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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:54:04,932 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:54:04,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:54:04,947 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:54:04,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:54:04,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:54:04,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:54:04,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:54:04,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:54:04,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:54:04,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:54:04,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:54:04,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:54:04,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:54:04,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:54:04,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:54:04,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:54:04,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:54:04,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:54:04,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:54:04,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:54:04,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:54:04,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:54:04,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:54:04,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:54:04,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:54:04,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:54:04,971 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:54:04,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:54:04,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:54:04,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:54:04,973 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:54:04,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:54:04,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:54:04,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:54:04,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:54:04,985 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:54:04,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:54:04,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:54:04,985 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:54:04,986 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:54:04,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:54:04,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:54:04,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:54:04,988 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:54:04,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:54:04,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:54:05,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:54:05,030 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:54:05,036 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:54:05,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:54:05,038 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:54:05,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-02-02 08:54:05,241 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:54:05,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:54:05,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:54:05,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:54:05,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:54:05,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a9d1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05, skipping insertion in model container [2018-02-02 08:54:05,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,268 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:54:05,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:54:05,383 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:54:05,397 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:54:05,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05 WrapperNode [2018-02-02 08:54:05,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:54:05,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:54:05,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:54:05,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:54:05,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... [2018-02-02 08:54:05,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:54:05,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:54:05,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:54:05,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:54:05,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 08:54:05,467 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:54:05,467 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:54:05,467 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 08:54:05,467 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:54:05,467 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:54:05,467 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:54:05,468 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 08:54:05,469 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:54:05,469 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:54:05,469 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:54:05,703 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:54:05,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:54:05 BoogieIcfgContainer [2018-02-02 08:54:05,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:54:05,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:54:05,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:54:05,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:54:05,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:54:05" (1/3) ... [2018-02-02 08:54:05,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:54:05, skipping insertion in model container [2018-02-02 08:54:05,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:05" (2/3) ... [2018-02-02 08:54:05,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:54:05, skipping insertion in model container [2018-02-02 08:54:05,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:54:05" (3/3) ... [2018-02-02 08:54:05,708 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-02-02 08:54:05,715 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:54:05,720 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-02 08:54:05,743 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:54:05,743 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:54:05,743 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:54:05,743 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:54:05,743 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:54:05,743 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:54:05,743 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:54:05,744 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:54:05,744 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:54:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-02-02 08:54:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 08:54:05,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:05,763 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:05,763 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -758648706, now seen corresponding path program 1 times [2018-02-02 08:54:05,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:05,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:05,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:05,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:05,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:05,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:05,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:05,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:54:05,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:54:05,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:54:05,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:05,881 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-02-02 08:54:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:06,014 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 08:54:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:54:06,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 08:54:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:06,080 INFO L225 Difference]: With dead ends: 92 [2018-02-02 08:54:06,080 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 08:54:06,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 08:54:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-02 08:54:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 08:54:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-02-02 08:54:06,113 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 7 [2018-02-02 08:54:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:06,114 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-02-02 08:54:06,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:54:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-02-02 08:54:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 08:54:06,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:06,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:06,114 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -758648705, now seen corresponding path program 1 times [2018-02-02 08:54:06,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:06,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:06,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:06,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:06,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:06,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:06,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:54:06,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:54:06,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:54:06,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:06,165 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 3 states. [2018-02-02 08:54:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:06,250 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-02-02 08:54:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:54:06,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 08:54:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:06,252 INFO L225 Difference]: With dead ends: 88 [2018-02-02 08:54:06,253 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 08:54:06,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 08:54:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-02-02 08:54:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 08:54:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-02 08:54:06,261 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 7 [2018-02-02 08:54:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:06,261 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-02 08:54:06,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:54:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-02 08:54:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:54:06,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:06,262 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:06,262 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash 689934579, now seen corresponding path program 1 times [2018-02-02 08:54:06,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:06,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:06,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:06,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:06,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:06,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:06,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:54:06,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:54:06,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:54:06,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:54:06,364 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2018-02-02 08:54:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:06,697 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-02-02 08:54:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:54:06,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 08:54:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:06,698 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:54:06,698 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:54:06,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:54:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:54:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 08:54:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 08:54:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-02 08:54:06,704 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2018-02-02 08:54:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:06,704 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-02 08:54:06,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:54:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-02 08:54:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:54:06,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:06,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:06,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash 689934580, now seen corresponding path program 1 times [2018-02-02 08:54:06,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:06,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:06,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:06,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:06,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:06,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:06,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:54:06,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:54:06,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:54:06,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:54:06,847 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 7 states. [2018-02-02 08:54:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,008 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-02 08:54:07,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:54:07,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-02 08:54:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,009 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:54:07,009 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 08:54:07,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:54:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 08:54:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-02-02 08:54:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 08:54:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-02-02 08:54:07,014 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 13 [2018-02-02 08:54:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,014 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-02-02 08:54:07,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:54:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-02-02 08:54:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:54:07,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,015 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,015 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash -86864468, now seen corresponding path program 1 times [2018-02-02 08:54:07,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:54:07,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:54:07,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:54:07,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:54:07,047 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2018-02-02 08:54:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,105 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-02-02 08:54:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:54:07,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:54:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,106 INFO L225 Difference]: With dead ends: 99 [2018-02-02 08:54:07,106 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:54:07,107 INFO L554 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-02-02 08:54:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:54:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-02 08:54:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 08:54:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-02 08:54:07,111 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 14 [2018-02-02 08:54:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,111 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-02 08:54:07,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:54:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-02 08:54:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:54:07,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,112 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,112 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -86864467, now seen corresponding path program 1 times [2018-02-02 08:54:07,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:54:07,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:54:07,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:54:07,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:54:07,158 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-02-02 08:54:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,200 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-02-02 08:54:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:54:07,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:54:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,201 INFO L225 Difference]: With dead ends: 95 [2018-02-02 08:54:07,201 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:54:07,201 INFO L554 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-02-02 08:54:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:54:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 08:54:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:54:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-02-02 08:54:07,205 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 14 [2018-02-02 08:54:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,205 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-02-02 08:54:07,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:54:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-02-02 08:54:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:54:07,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,205 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,206 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1124026018, now seen corresponding path program 1 times [2018-02-02 08:54:07,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:54:07,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:54:07,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:54:07,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:54:07,273 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 8 states. [2018-02-02 08:54:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,444 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 08:54:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:54:07,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 08:54:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,445 INFO L225 Difference]: With dead ends: 92 [2018-02-02 08:54:07,445 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 08:54:07,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 08:54:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 08:54:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 08:54:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 08:54:07,448 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 19 [2018-02-02 08:54:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,448 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 08:54:07,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:54:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 08:54:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:54:07,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,449 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,449 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash -858054687, now seen corresponding path program 1 times [2018-02-02 08:54:07,449 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:54:07,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:54:07,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:54:07,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:54:07,544 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 6 states. [2018-02-02 08:54:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,638 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 08:54:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:54:07,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 08:54:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,639 INFO L225 Difference]: With dead ends: 95 [2018-02-02 08:54:07,639 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:54:07,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:54:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:54:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 08:54:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 08:54:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 08:54:07,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 27 [2018-02-02 08:54:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,643 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 08:54:07,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:54:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 08:54:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:54:07,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,644 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134626, now seen corresponding path program 1 times [2018-02-02 08:54:07,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:54:07,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:54:07,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:54:07,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:54:07,715 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2018-02-02 08:54:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:07,851 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-02-02 08:54:07,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:54:07,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 08:54:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:07,852 INFO L225 Difference]: With dead ends: 101 [2018-02-02 08:54:07,852 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 08:54:07,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:54:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 08:54:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-02-02 08:54:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 08:54:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-02 08:54:07,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 30 [2018-02-02 08:54:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:07,854 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-02 08:54:07,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:54:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-02 08:54:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:54:07,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:07,855 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:07,858 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:07,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134627, now seen corresponding path program 1 times [2018-02-02 08:54:07,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:07,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:07,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:07,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:07,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:07,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:07,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:54:07,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:54:07,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:54:07,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:54:07,972 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 9 states. [2018-02-02 08:54:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:08,132 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-02 08:54:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:54:08,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 08:54:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:08,133 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:54:08,133 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:54:08,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:54:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:54:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-02-02 08:54:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 08:54:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-02 08:54:08,136 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 30 [2018-02-02 08:54:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:08,136 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-02 08:54:08,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:54:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-02 08:54:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:54:08,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:08,137 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 08:54:08,137 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:08,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1019097774, now seen corresponding path program 1 times [2018-02-02 08:54:08,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:08,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:08,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:08,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:08,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:08,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:54:08,253 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:54:08,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:08,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:08,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:08,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:08,369 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-02-02 08:54:08,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:08,384 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 12 treesize of output 15 [2018-02-02 08:54:08,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:08,389 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-02-02 08:54:08,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-02 08:54:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:08,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:54:08,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-02 08:54:08,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:54:08,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:54:08,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:08,440 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 13 states. [2018-02-02 08:54:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:08,627 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-02 08:54:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:54:08,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 08:54:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:08,628 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:54:08,628 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:54:08,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:54:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:54:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-02-02 08:54:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 08:54:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-02 08:54:08,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 32 [2018-02-02 08:54:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:08,631 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-02 08:54:08,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:54:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-02 08:54:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:54:08,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:08,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:08,633 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash -952870546, now seen corresponding path program 1 times [2018-02-02 08:54:08,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:08,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:08,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:08,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:08,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:08,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:08,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:54:08,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:54:08,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:54:08,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:54:08,676 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 5 states. [2018-02-02 08:54:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:08,742 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-02-02 08:54:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:54:08,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 08:54:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:08,743 INFO L225 Difference]: With dead ends: 86 [2018-02-02 08:54:08,744 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 08:54:08,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:54:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 08:54:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-02-02 08:54:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 08:54:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-02 08:54:08,747 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 33 [2018-02-02 08:54:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:08,747 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-02 08:54:08,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:54:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-02 08:54:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:54:08,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:08,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:08,748 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792313, now seen corresponding path program 1 times [2018-02-02 08:54:08,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:08,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:08,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:08,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:08,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:08,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:08,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:54:08,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:54:08,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:54:08,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:54:08,819 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 8 states. [2018-02-02 08:54:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:08,916 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-02-02 08:54:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:54:08,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 08:54:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:08,916 INFO L225 Difference]: With dead ends: 85 [2018-02-02 08:54:08,917 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 08:54:08,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 08:54:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-02-02 08:54:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 08:54:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-02-02 08:54:08,919 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 33 [2018-02-02 08:54:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:08,919 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-02-02 08:54:08,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:54:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-02-02 08:54:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:54:08,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:08,920 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:08,920 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792312, now seen corresponding path program 1 times [2018-02-02 08:54:08,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:08,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:08,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:08,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:08,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:08,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:08,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:54:08,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:54:08,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:54:08,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:54:08,953 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-02-02 08:54:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:09,020 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-02-02 08:54:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:54:09,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 08:54:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:09,021 INFO L225 Difference]: With dead ends: 81 [2018-02-02 08:54:09,021 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 08:54:09,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:54:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 08:54:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 08:54:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 08:54:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-02-02 08:54:09,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 33 [2018-02-02 08:54:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:09,023 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-02-02 08:54:09,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:54:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-02-02 08:54:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:54:09,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:09,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:09,025 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -881792853, now seen corresponding path program 1 times [2018-02-02 08:54:09,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:09,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:09,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:09,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:09,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:09,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:09,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:54:09,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:54:09,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:54:09,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:54:09,097 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 8 states. [2018-02-02 08:54:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:09,216 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-02 08:54:09,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:54:09,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-02 08:54:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:09,217 INFO L225 Difference]: With dead ends: 78 [2018-02-02 08:54:09,217 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 08:54:09,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 08:54:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 08:54:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 08:54:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-02 08:54:09,220 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 35 [2018-02-02 08:54:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:09,220 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-02 08:54:09,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:54:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-02 08:54:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:54:09,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:09,221 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:09,221 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468264, now seen corresponding path program 1 times [2018-02-02 08:54:09,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:09,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:09,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:09,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:09,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:09,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:09,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:54:09,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:54:09,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:54:09,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:54:09,367 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 12 states. [2018-02-02 08:54:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:09,524 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-02 08:54:09,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:54:09,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 08:54:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:09,525 INFO L225 Difference]: With dead ends: 77 [2018-02-02 08:54:09,525 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 08:54:09,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:54:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 08:54:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 08:54:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 08:54:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-02-02 08:54:09,527 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 35 [2018-02-02 08:54:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:09,527 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-02-02 08:54:09,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:54:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-02-02 08:54:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:54:09,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:09,527 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-02-02 08:54:09,527 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 403683132, now seen corresponding path program 1 times [2018-02-02 08:54:09,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:09,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:09,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:09,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:09,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:09,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:54:09,701 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:54:09,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:09,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:09,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:54:09,777 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-02-02 08:54:09,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-02 08:54:09,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 15 [2018-02-02 08:54:09,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-02 08:54:09,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-02 08:54:09,922 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 26 treesize of output 25 [2018-02-02 08:54:09,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:09,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-02 08:54:09,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-02 08:54:09,986 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-02 08:54:09,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:09,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:09,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-02 08:54:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:10,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:54:10,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-02-02 08:54:10,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 08:54:10,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 08:54:10,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:54:10,038 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 21 states. [2018-02-02 08:54:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:10,529 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-02-02 08:54:10,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:54:10,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-02-02 08:54:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:10,530 INFO L225 Difference]: With dead ends: 78 [2018-02-02 08:54:10,531 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 08:54:10,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:54:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 08:54:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-02 08:54:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 08:54:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-02 08:54:10,533 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 38 [2018-02-02 08:54:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:10,534 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-02 08:54:10,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 08:54:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-02 08:54:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:54:10,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:10,534 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-02-02 08:54:10,534 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 403683133, now seen corresponding path program 1 times [2018-02-02 08:54:10,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:10,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:10,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:10,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:10,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:10,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:10,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:54:10,681 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:54:10,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:10,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:10,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:54:10,727 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-02-02 08:54:10,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,735 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:54:10,737 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-02-02 08:54:10,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-02 08:54:10,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:10,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:10,819 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 15 treesize of output 8 [2018-02-02 08:54:10,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,826 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 23 [2018-02-02 08:54:10,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-02 08:54:10,897 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-02 08:54:10,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 33 [2018-02-02 08:54:10,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,939 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-02 08:54:10,953 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 24 treesize of output 23 [2018-02-02 08:54:10,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:10,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:10,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-02 08:54:11,019 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 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-02 08:54:11,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-02 08:54:11,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,043 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 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-02 08:54:11,047 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 22 treesize of output 15 [2018-02-02 08:54:11,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,056 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 15 treesize of output 8 [2018-02-02 08:54:11,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,064 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-02-02 08:54:11,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:11,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:11,072 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-02 08:54:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:11,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:54:11,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-02 08:54:11,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:54:11,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:54:11,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:54:11,113 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 22 states. [2018-02-02 08:54:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:11,750 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-02-02 08:54:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:54:11,750 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-02-02 08:54:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:11,751 INFO L225 Difference]: With dead ends: 77 [2018-02-02 08:54:11,751 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 08:54:11,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:54:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 08:54:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-02 08:54:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 08:54:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-02 08:54:11,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 38 [2018-02-02 08:54:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:11,753 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-02 08:54:11,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:54:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-02 08:54:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 08:54:11,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:11,753 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:11,753 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 467955640, now seen corresponding path program 1 times [2018-02-02 08:54:11,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:11,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:11,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:11,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:11,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:11,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:12,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:12,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 08:54:12,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:54:12,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:54:12,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:54:12,221 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-02-02 08:54:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:12,746 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-02 08:54:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:54:12,747 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-02-02 08:54:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:12,747 INFO L225 Difference]: With dead ends: 94 [2018-02-02 08:54:12,747 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 08:54:12,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:54:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 08:54:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-02-02 08:54:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 08:54:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-02-02 08:54:12,750 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 40 [2018-02-02 08:54:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:12,750 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-02-02 08:54:12,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:54:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-02-02 08:54:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 08:54:12,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:12,751 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:12,751 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:54:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1267428235, now seen corresponding path program 1 times [2018-02-02 08:54:12,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:12,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:12,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:12,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:12,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 08:54:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 08:54:12,794 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 08:54:12,808 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 08:54:12,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:54:12 BoogieIcfgContainer [2018-02-02 08:54:12,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:54:12,823 INFO L168 Benchmark]: Toolchain (without parser) took 7581.55 ms. Allocated memory was 404.2 MB in the beginning and 792.2 MB in the end (delta: 388.0 MB). Free memory was 361.1 MB in the beginning and 604.9 MB in the end (delta: -243.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 5.3 GB. [2018-02-02 08:54:12,824 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:54:12,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.35 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:54:12,824 INFO L168 Benchmark]: Boogie Preprocessor took 28.20 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 349.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:54:12,825 INFO L168 Benchmark]: RCFGBuilder took 273.67 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 320.6 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:54:12,825 INFO L168 Benchmark]: TraceAbstraction took 7118.10 ms. Allocated memory was 404.2 MB in the beginning and 792.2 MB in the end (delta: 388.0 MB). Free memory was 320.6 MB in the beginning and 604.9 MB in the end (delta: -284.3 MB). Peak memory consumption was 103.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:54:12,826 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.21 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.35 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.20 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 349.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 273.67 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 320.6 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7118.10 ms. Allocated memory was 404.2 MB in the beginning and 792.2 MB in the end (delta: 388.0 MB). Free memory was 320.6 MB in the beginning and 604.9 MB in the end (delta: -284.3 MB). Peak memory consumption was 103.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={11:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L641] FCALL free(list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}] [L642] FCALL list = next VAL [list={10:0}, next={0:0}] [L644] FCALL \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; VAL [\result=0, list={10:0}, next={0:0}] [L635] FCALL struct item *list = ((void *)0); VAL [\result=0, list={10:0}, next={0:0}] [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 41 error locations. UNSAFE Result, 7.0s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1043 SDtfs, 1114 SDslu, 3209 SDs, 0 SdLazy, 3422 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 102 SyntacticMatches, 17 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 71 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 577 ConstructedInterpolants, 13 QuantifiedInterpolants, 182044 SizeOfPredicates, 42 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 18/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-54-12-832.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-54-12-832.csv Received shutdown request...