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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:50:57,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:50:57,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:50:57,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:50:57,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:50:57,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:50:57,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:50:57,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:50:57,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:50:57,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:50:57,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:50:57,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:50:57,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:50:57,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:50:57,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:50:57,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:50:57,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:50:57,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:50:57,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:50:57,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:50:57,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:50:57,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:50:57,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:50:57,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:50:57,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:50:57,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:50:57,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:50:57,334 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:50:57,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:50:57,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:50:57,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:50:57,335 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:50:57,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:50:57,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:50:57,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:50:57,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:50:57,346 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:50:57,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:50:57,347 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:50:57,348 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:50:57,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:50:57,348 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:50:57,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:50:57,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:50:57,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:50:57,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:50:57,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:50:57,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:50:57,349 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:50:57,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:50:57,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:50:57,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:50:57,391 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:50:57,394 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:50:57,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:50:57,396 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:50:57,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:57,528 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:50:57,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:50:57,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:57,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:50:57,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:50:57,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559dcc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57, skipping insertion in model container [2018-02-03 22:50:57,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:57,579 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:57,674 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:57,688 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:57,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57 WrapperNode [2018-02-03 22:50:57,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:57,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:50:57,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:50:57,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:50:57,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (1/1) ... [2018-02-03 22:50:57,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:50:57,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:50:57,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:50:57,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:50:57,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (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-03 22:50:57,761 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:50:57,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:50:57,762 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-02-03 22:50:57,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-02-03 22:50:57,762 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:50:57,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:50:57,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:50:57,944 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:50:57,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:57 BoogieIcfgContainer [2018-02-03 22:50:57,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:50:57,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:50:57,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:50:57,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:50:57,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:50:57" (1/3) ... [2018-02-03 22:50:57,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15094d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:57, skipping insertion in model container [2018-02-03 22:50:57,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:57" (2/3) ... [2018-02-03 22:50:57,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15094d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:57, skipping insertion in model container [2018-02-03 22:50:57,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:57" (3/3) ... [2018-02-03 22:50:57,950 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:57,957 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:50:57,962 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:50:57,988 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:50:57,988 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:50:57,988 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:50:57,988 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:50:57,988 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:50:57,988 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:50:57,988 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:50:57,989 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:50:57,989 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:50:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-03 22:50:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:50:58,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,011 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-02-03 22:50:58,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,210 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-03 22:50:58,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:50:58,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:50:58,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:50:58,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:50:58,224 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-03 22:50:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,355 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-03 22:50:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:50:58,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:50:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,364 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:50:58,365 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:50:58,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:50:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:50:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:50:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-03 22:50:58,391 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-02-03 22:50:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,391 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-03 22:50:58,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:50:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-03 22:50:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:50:58,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,392 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,392 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-02-03 22:50:58,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,503 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-03 22:50:58,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:58,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:58,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:58,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:58,505 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-03 22:50:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,565 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-03 22:50:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:58,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:50:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,567 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:50:58,567 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:50:58,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:50:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:50:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:50:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:50:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-03 22:50:58,572 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-02-03 22:50:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,572 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-03 22:50:58,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-03 22:50:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:50:58,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,573 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,573 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-02-03 22:50:58,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:50:58,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:50:58,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:50:58,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:50:58,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:58,639 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-02-03 22:50:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,673 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-03 22:50:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:58,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:50:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,674 INFO L225 Difference]: With dead ends: 47 [2018-02-03 22:50:58,674 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:50:58,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:50:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:50:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:50:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-03 22:50:58,679 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-02-03 22:50:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,679 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-03 22:50:58,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:50:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-03 22:50:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:50:58,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,680 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,680 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-02-03 22:50:58,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,718 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-03 22:50:58,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:50:58,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:50:58,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:50:58,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:50:58,719 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-02-03 22:50:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,756 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-02-03 22:50:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:50:58,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:50:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,757 INFO L225 Difference]: With dead ends: 46 [2018-02-03 22:50:58,757 INFO L226 Difference]: Without dead ends: 46 [2018-02-03 22:50:58,758 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-03 22:50:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-03 22:50:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-03 22:50:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:50:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-03 22:50:58,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-02-03 22:50:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,762 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-03 22:50:58,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:50:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-03 22:50:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:50:58,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,763 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,763 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-02-03 22:50:58,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,764 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,816 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-03 22:50:58,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:50:58,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:50:58,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:50:58,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:58,817 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-03 22:50:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,862 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:50:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:50:58,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 22:50:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,863 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:50:58,863 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 22:50:58,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 22:50:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 22:50:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-03 22:50:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 22:50:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-02-03 22:50:58,867 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-02-03 22:50:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,868 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-02-03 22:50:58,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:50:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-02-03 22:50:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:50:58,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,868 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,869 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-02-03 22:50:58,869 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,870 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,957 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-03 22:50:58,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:58,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:58,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:58,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:58,958 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-02-03 22:50:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,058 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-03 22:50:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:50:59,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-03 22:50:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,060 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:50:59,060 INFO L226 Difference]: Without dead ends: 59 [2018-02-03 22:50:59,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:50:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-03 22:50:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-02-03 22:50:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:50:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-03 22:50:59,063 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-02-03 22:50:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,064 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-03 22:50:59,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-03 22:50:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:50:59,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,064 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] [2018-02-03 22:50:59,064 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-02-03 22:50:59,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,065 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,093 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-03 22:50:59,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:59,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:59,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:59,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:59,094 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-02-03 22:50:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,153 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-03 22:50:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:59,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-03 22:50:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,154 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:50:59,154 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:50:59,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:50:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:50:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:50:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-03 22:50:59,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-02-03 22:50:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,157 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-03 22:50:59,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-03 22:50:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:50:59,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,158 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] [2018-02-03 22:50:59,158 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-02-03 22:50:59,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,243 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-03 22:50:59,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:50:59,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:50:59,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:50:59,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:50:59,244 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-02-03 22:50:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,337 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-03 22:50:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:50:59,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-03 22:50:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,338 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:50:59,338 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:50:59,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:50:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:50:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:50:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:50:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-03 22:50:59,341 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-02-03 22:50:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,342 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-03 22:50:59,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:50:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-03 22:50:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:50:59,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,343 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] [2018-02-03 22:50:59,343 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-02-03 22:50:59,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,379 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-03 22:50:59,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:59,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:59,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:59,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:59,380 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-02-03 22:50:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,423 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-03 22:50:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:59,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-03 22:50:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,424 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:50:59,424 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:50:59,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:50:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:50:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:50:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-03 22:50:59,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-02-03 22:50:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,430 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-03 22:50:59,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-03 22:50:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:50:59,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,430 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] [2018-02-03 22:50:59,430 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-02-03 22:50:59,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,500 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-03 22:50:59,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:59,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:59,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:59,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:59,502 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-02-03 22:50:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,586 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-03 22:50:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:50:59,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-03 22:50:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,587 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:50:59,587 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:50:59,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:50:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:50:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-02-03 22:50:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:50:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-03 22:50:59,594 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-02-03 22:50:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,594 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-03 22:50:59,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-03 22:50:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:59,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,595 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] [2018-02-03 22:50:59,595 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-02-03 22:50:59,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,630 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-03 22:50:59,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:59,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:59,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:59,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:59,631 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-02-03 22:50:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,678 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-03 22:50:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:59,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-03 22:50:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,678 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:50:59,678 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:50:59,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:50:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:50:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:50:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-03 22:50:59,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-02-03 22:50:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,681 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-03 22:50:59,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-03 22:50:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:59,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,682 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] [2018-02-03 22:50:59,682 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-02-03 22:50:59,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,756 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-03 22:50:59,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:50:59,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:50:59,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:50:59,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:50:59,757 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-02-03 22:50:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,869 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-03 22:50:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:50:59,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-03 22:50:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,870 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:50:59,870 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:50:59,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:50:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:50:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-02-03 22:50:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:50:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-03 22:50:59,873 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-02-03 22:50:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,873 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-03 22:50:59,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:50:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-03 22:50:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:50:59,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,874 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:59,874 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-02-03 22:50:59,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:00,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:00,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:51:00,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:51:00,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:51:00,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:00,020 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-02-03 22:51:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:00,165 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-03 22:51:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:51:00,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-03 22:51:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:00,166 INFO L225 Difference]: With dead ends: 81 [2018-02-03 22:51:00,166 INFO L226 Difference]: Without dead ends: 81 [2018-02-03 22:51:00,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:51:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-03 22:51:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-02-03 22:51:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 22:51:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-03 22:51:00,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-02-03 22:51:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:00,169 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-03 22:51:00,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:51:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-03 22:51:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:51:00,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:00,170 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:00,170 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-02-03 22:51:00,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:00,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:00,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:00,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:00,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:00,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:00,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:00,356 INFO L213 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-03 22:51:00,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:00,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:00,435 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-03 22:51:00,438 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-03 22:51:00,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-03 22:51:00,587 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 26 treesize of output 26 [2018-02-03 22:51:00,590 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-03 22:51:00,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,598 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-03 22:51:00,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,617 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-03 22:51:00,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-02-03 22:51:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:00,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:51:00,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2018-02-03 22:51:00,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:51:00,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:51:00,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:51:00,663 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 22 states. [2018-02-03 22:51:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:01,660 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-03 22:51:01,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:51:01,661 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-02-03 22:51:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:01,662 INFO L225 Difference]: With dead ends: 144 [2018-02-03 22:51:01,662 INFO L226 Difference]: Without dead ends: 144 [2018-02-03 22:51:01,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2018-02-03 22:51:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-03 22:51:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2018-02-03 22:51:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-03 22:51:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-03 22:51:01,668 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2018-02-03 22:51:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:01,669 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-03 22:51:01,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:51:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-03 22:51:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 22:51:01,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:01,670 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:01,670 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1662500005, now seen corresponding path program 1 times [2018-02-03 22:51:01,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:01,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:01,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:01,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:01,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:01,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:01,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:01,849 INFO L213 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-03 22:51:01,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:01,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:01,887 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 14 treesize of output 11 [2018-02-03 22:51:01,889 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 11 treesize of output 10 [2018-02-03 22:51:01,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:01,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:01,895 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-03 22:51:01,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:51:02,077 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 31 treesize of output 31 [2018-02-03 22:51:02,084 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 1 case distinctions, treesize of input 27 treesize of output 25 [2018-02-03 22:51:02,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:02,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-02-03 22:51:02,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:02,121 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 19 treesize of output 14 [2018-02-03 22:51:02,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:51:02,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:02,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-02-03 22:51:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:02,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:02,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-02-03 22:51:02,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:51:02,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:51:02,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:51:02,252 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 23 states. [2018-02-03 22:51:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,068 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-03 22:51:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:51:04,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-03 22:51:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,069 INFO L225 Difference]: With dead ends: 79 [2018-02-03 22:51:04,069 INFO L226 Difference]: Without dead ends: 79 [2018-02-03 22:51:04,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=144, Invalid=1045, Unknown=1, NotChecked=0, Total=1190 [2018-02-03 22:51:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-03 22:51:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-03 22:51:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-03 22:51:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-03 22:51:04,072 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 27 [2018-02-03 22:51:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,072 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-03 22:51:04,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:51:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-03 22:51:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:04,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,073 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] [2018-02-03 22:51:04,074 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 65327996, now seen corresponding path program 1 times [2018-02-03 22:51:04,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:04,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:04,156 INFO L213 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-03 22:51:04,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:04,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:04,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2018-02-03 22:51:04,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:51:04,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:51:04,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:51:04,205 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 11 states. [2018-02-03 22:51:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,333 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-02-03 22:51:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:51:04,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-03 22:51:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,334 INFO L225 Difference]: With dead ends: 84 [2018-02-03 22:51:04,334 INFO L226 Difference]: Without dead ends: 84 [2018-02-03 22:51:04,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:51:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-03 22:51:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-02-03 22:51:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 22:51:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-03 22:51:04,336 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 29 [2018-02-03 22:51:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,336 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-03 22:51:04,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:51:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-03 22:51:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:51:04,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,337 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] [2018-02-03 22:51:04,337 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash -580377695, now seen corresponding path program 1 times [2018-02-03 22:51:04,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:04,406 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-03 22:51:04,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:04,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:51:04,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:51:04,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:51:04,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:51:04,407 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2018-02-03 22:51:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,504 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-02-03 22:51:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:51:04,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-03 22:51:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,505 INFO L225 Difference]: With dead ends: 74 [2018-02-03 22:51:04,505 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:51:04,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:51:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:51:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-03 22:51:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-03 22:51:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-03 22:51:04,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2018-02-03 22:51:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,509 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-03 22:51:04,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:51:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-03 22:51:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:51:04,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,510 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:04,510 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1644356119, now seen corresponding path program 1 times [2018-02-03 22:51:04,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:04,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:04,640 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:04,647 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:04,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:51:04,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2018-02-03 22:51:04,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:51:04,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:51:04,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:51:04,769 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2018-02-03 22:51:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,905 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-03 22:51:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:51:04,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-03 22:51:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,906 INFO L225 Difference]: With dead ends: 39 [2018-02-03 22:51:04,906 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:51:04,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:51:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:51:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-03 22:51:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:51:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-03 22:51:04,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-02-03 22:51:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,908 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-03 22:51:04,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:51:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-03 22:51:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:51:04,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,909 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:04,909 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash 566109348, now seen corresponding path program 1 times [2018-02-03 22:51:04,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:05,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:05,227 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:05,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:05,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:05,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:05,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:05,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:05,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:05,278 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-03 22:51:05,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:05,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:05,291 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-03 22:51:05,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:51:05,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 22:51:05,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 22:51:05,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-03 22:51:05,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-03 22:51:05,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:51:05,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:05,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-03 22:51:05,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-02-03 22:51:05,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:51:05,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:05,649 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 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-03 22:51:05,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:05,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:05,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:05,657 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-03 22:51:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:05,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:05,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-02-03 22:51:05,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:51:05,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:51:05,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:51:05,724 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-02-03 22:51:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:06,441 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-02-03 22:51:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:51:06,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-02-03 22:51:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:06,442 INFO L225 Difference]: With dead ends: 36 [2018-02-03 22:51:06,442 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:51:06,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 22:51:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:51:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-02-03 22:51:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:51:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-03 22:51:06,443 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-02-03 22:51:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:06,443 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-03 22:51:06,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:51:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-03 22:51:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:51:06,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:06,444 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:06,444 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1429764731, now seen corresponding path program 2 times [2018-02-03 22:51:06,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:06,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:06,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:06,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:06,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:06,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:06,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:06,671 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:06,677 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:06,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:06,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:06,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:06,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:06,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:51:06,731 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 16 treesize of output 13 [2018-02-03 22:51:06,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:51:06,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,735 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-03 22:51:06,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-02-03 22:51:06,975 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 33 treesize of output 33 [2018-02-03 22:51:06,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-02-03 22:51:06,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:07,001 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 1 case distinctions, treesize of input 29 treesize of output 27 [2018-02-03 22:51:07,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:07,011 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 21 treesize of output 16 [2018-02-03 22:51:07,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:07,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:51:07,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:07,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-03 22:51:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:07,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:07,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-03 22:51:07,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:51:07,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:51:07,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:51:07,086 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2018-02-03 22:51:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:07,749 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-02-03 22:51:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:51:07,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-02-03 22:51:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:07,749 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:51:07,749 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:51:07,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=1574, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:51:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:51:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:51:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:51:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:51:07,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-03 22:51:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:07,750 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:51:07,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:51:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:51:07,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:51:07,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:51:07 BoogieIcfgContainer [2018-02-03 22:51:07,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:51:07,754 INFO L168 Benchmark]: Toolchain (without parser) took 10224.99 ms. Allocated memory was 408.4 MB in the beginning and 761.3 MB in the end (delta: 352.8 MB). Free memory was 366.6 MB in the beginning and 458.2 MB in the end (delta: -91.5 MB). Peak memory consumption was 261.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:07,754 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:51:07,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.36 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:07,755 INFO L168 Benchmark]: Boogie Preprocessor took 27.62 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 353.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:07,755 INFO L168 Benchmark]: RCFGBuilder took 222.18 ms. Allocated memory is still 408.4 MB. Free memory was 353.4 MB in the beginning and 334.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:07,755 INFO L168 Benchmark]: TraceAbstraction took 9807.86 ms. Allocated memory was 408.4 MB in the beginning and 761.3 MB in the end (delta: 352.8 MB). Free memory was 334.0 MB in the beginning and 458.2 MB in the end (delta: -124.1 MB). Peak memory consumption was 228.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:07,755 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.15 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.36 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.62 ms. Allocated memory is still 408.4 MB. Free memory was 354.7 MB in the beginning and 353.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 222.18 ms. Allocated memory is still 408.4 MB. Free memory was 353.4 MB in the beginning and 334.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9807.86 ms. Allocated memory was 408.4 MB in the beginning and 761.3 MB in the end (delta: 352.8 MB). Free memory was 334.0 MB in the beginning and 458.2 MB in the end (delta: -124.1 MB). Peak memory consumption was 228.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. SAFE Result, 9.7s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 643 SDtfs, 1091 SDslu, 2643 SDs, 0 SdLazy, 2803 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=14, 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, 20 MinimizatonAttempts, 108 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 608 ConstructedInterpolants, 40 QuantifiedInterpolants, 132084 SizeOfPredicates, 52 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 27/88 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-51-07-760.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-51-07-760.csv Received shutdown request...