java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:43:07,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:43:07,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:43:07,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:43:07,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:43:07,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:43:07,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:43:07,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:43:07,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:43:07,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:43:07,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:43:07,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:43:07,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:43:07,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:43:07,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:43:07,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:43:07,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:43:07,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:43:07,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:43:07,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:43:07,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:43:07,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:43:07,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:43:07,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:43:07,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:43:07,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:43:07,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:43:07,391 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:43:07,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:43:07,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:43:07,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:43:07,392 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:43:07,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:43:07,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:43:07,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:43:07,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:43:07,404 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:43:07,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:43:07,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:43:07,404 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:43:07,405 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:43:07,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:43:07,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:43:07,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:43:07,407 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:43:07,407 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:43:07,407 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:43:07,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:43:07,450 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:43:07,454 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:43:07,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:43:07,455 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:43:07,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:43:07,598 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:43:07,599 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:43:07,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:43:07,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:43:07,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:43:07,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07, skipping insertion in model container [2018-02-02 08:43:07,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:43:07,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:43:07,729 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:43:07,746 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:43:07,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07 WrapperNode [2018-02-02 08:43:07,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:43:07,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:43:07,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:43:07,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:43:07,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... [2018-02-02 08:43:07,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:43:07,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:43:07,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:43:07,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:43:07,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:43:07,807 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:43:07,807 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:43:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-02 08:43:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:43:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-02 08:43:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:43:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:43:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:43:07,969 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:43:07,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:07 BoogieIcfgContainer [2018-02-02 08:43:07,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:43:07,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:43:07,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:43:07,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:43:07,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:43:07" (1/3) ... [2018-02-02 08:43:07,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d43d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:07, skipping insertion in model container [2018-02-02 08:43:07,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:07" (2/3) ... [2018-02-02 08:43:07,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d43d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:07, skipping insertion in model container [2018-02-02 08:43:07,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:07" (3/3) ... [2018-02-02 08:43:07,975 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:43:07,981 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:43:07,985 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 08:43:08,008 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:43:08,008 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:43:08,008 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:43:08,008 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:43:08,008 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:43:08,008 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:43:08,008 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:43:08,009 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:43:08,009 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:43:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-02 08:43:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:43:08,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,027 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:08,028 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash 380982983, now seen corresponding path program 1 times [2018-02-02 08:43:08,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:43:08,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:43:08,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:43:08,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:43:08,218 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-02 08:43:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:08,363 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-02 08:43:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:43:08,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:43:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:08,372 INFO L225 Difference]: With dead ends: 57 [2018-02-02 08:43:08,372 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 08:43:08,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:43:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 08:43:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 08:43:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 08:43:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 08:43:08,399 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-02 08:43:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:08,399 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 08:43:08,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:43:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 08:43:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:43:08,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,400 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:08,400 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash 380982984, now seen corresponding path program 1 times [2018-02-02 08:43:08,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:08,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:08,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:08,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:08,495 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-02 08:43:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:08,556 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-02 08:43:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:08,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 08:43:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:08,558 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:43:08,558 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 08:43:08,559 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-02 08:43:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 08:43:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 08:43:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:43:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-02 08:43:08,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-02 08:43:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:08,564 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-02 08:43:08,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-02 08:43:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:43:08,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:08,565 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429420, now seen corresponding path program 1 times [2018-02-02 08:43:08,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:43:08,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:43:08,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:43:08,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:43:08,595 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-02 08:43:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:08,638 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-02 08:43:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:43:08,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:43:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:08,639 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:43:08,639 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:43:08,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:43:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:43:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:43:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:43:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-02 08:43:08,642 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-02 08:43:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:08,642 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-02 08:43:08,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:43:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-02 08:43:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:43:08,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:08,643 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429419, now seen corresponding path program 1 times [2018-02-02 08:43:08,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:43:08,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:43:08,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:43:08,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:43:08,712 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-02 08:43:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:08,756 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-02 08:43:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:08,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 08:43:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:08,757 INFO L225 Difference]: With dead ends: 51 [2018-02-02 08:43:08,757 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 08:43:08,757 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-02 08:43:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 08:43:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 08:43:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 08:43:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-02 08:43:08,761 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-02 08:43:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:08,761 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-02 08:43:08,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:43:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-02 08:43:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 08:43:08,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,762 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-02 08:43:08,762 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -425895657, now seen corresponding path program 1 times [2018-02-02 08:43:08,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:43:08,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:43:08,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:43:08,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:43:08,804 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-02 08:43:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:08,846 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-02 08:43:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:43:08,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 08:43:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:08,847 INFO L225 Difference]: With dead ends: 49 [2018-02-02 08:43:08,847 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 08:43:08,848 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-02 08:43:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 08:43:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 08:43:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 08:43:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-02 08:43:08,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-02 08:43:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:08,852 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-02 08:43:08,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:43:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-02 08:43:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 08:43:08,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:08,853 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-02 08:43:08,853 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash -425895656, now seen corresponding path program 1 times [2018-02-02 08:43:08,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:08,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:08,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:08,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:08,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:08,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:08,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:43:08,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:43:08,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:43:08,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:08,938 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-02 08:43:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:09,090 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-02 08:43:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:43:09,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-02 08:43:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:09,093 INFO L225 Difference]: With dead ends: 73 [2018-02-02 08:43:09,093 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 08:43:09,094 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-02 08:43:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 08:43:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-02 08:43:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:43:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-02 08:43:09,097 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-02 08:43:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:09,097 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-02 08:43:09,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:43:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-02 08:43:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:43:09,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:09,098 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] [2018-02-02 08:43:09,098 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031168, now seen corresponding path program 1 times [2018-02-02 08:43:09,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:09,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:09,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:09,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:09,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:09,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:09,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:09,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:09,137 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-02 08:43:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:09,193 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-02 08:43:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:43:09,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 08:43:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:09,195 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:43:09,195 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 08:43:09,195 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-02 08:43:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 08:43:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-02 08:43:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 08:43:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-02 08:43:09,198 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-02 08:43:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:09,199 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-02 08:43:09,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-02 08:43:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:43:09,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:09,200 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] [2018-02-02 08:43:09,200 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031167, now seen corresponding path program 1 times [2018-02-02 08:43:09,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:09,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:09,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:09,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:09,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:43:09,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:43:09,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:43:09,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:43:09,289 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-02 08:43:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:09,390 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-02 08:43:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:43:09,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 08:43:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:09,391 INFO L225 Difference]: With dead ends: 67 [2018-02-02 08:43:09,391 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 08:43:09,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:43:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 08:43:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-02 08:43:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:43:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-02 08:43:09,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-02 08:43:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:09,394 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-02 08:43:09,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:43:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-02 08:43:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:43:09,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:09,395 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, 1, 1, 1] [2018-02-02 08:43:09,395 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1785224664, now seen corresponding path program 1 times [2018-02-02 08:43:09,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:09,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:09,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:09,419 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-02 08:43:09,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:09,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:43:09,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:43:09,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:43:09,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:43:09,420 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-02-02 08:43:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:09,426 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-02 08:43:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:43:09,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 08:43:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:09,427 INFO L225 Difference]: With dead ends: 60 [2018-02-02 08:43:09,427 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 08:43:09,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:43:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 08:43:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 08:43:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 08:43:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-02-02 08:43:09,431 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-02-02 08:43:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:09,431 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-02-02 08:43:09,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:43:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-02-02 08:43:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:43:09,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:09,432 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] [2018-02-02 08:43:09,432 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash -419708018, now seen corresponding path program 1 times [2018-02-02 08:43:09,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:09,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:09,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:09,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:09,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:43:09,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:43:09,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:43:09,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:43:09,510 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 6 states. [2018-02-02 08:43:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:09,629 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-02-02 08:43:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:43:09,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 08:43:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:09,630 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:43:09,630 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 08:43:09,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:43:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 08:43:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 08:43:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 08:43:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-02 08:43:09,634 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-02 08:43:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:09,634 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-02 08:43:09,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:43:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-02 08:43:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:43:09,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:09,635 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, 1, 1, 1, 1, 1] [2018-02-02 08:43:09,635 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2090509973, now seen corresponding path program 1 times [2018-02-02 08:43:09,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:09,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:09,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:09,827 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-02 08:43:09,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:09,827 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:43:09,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:09,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:09,898 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-02 08:43:09,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:09,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:09,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:43:09,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:09,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:09,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:43:09,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:09,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:09,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:43:10,012 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 11 treesize of output 8 [2018-02-02 08:43:10,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:43:10,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-02-02 08:43:10,033 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 22 treesize of output 23 [2018-02-02 08:43:10,034 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-02 08:43:10,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:43:10,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-02-02 08:43:10,113 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 25 treesize of output 23 [2018-02-02 08:43:10,116 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 8 treesize of output 1 [2018-02-02 08:43:10,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 08:43:10,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:10,126 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-02-02 08:43:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:10,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:43:10,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-02-02 08:43:10,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:43:10,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:43:10,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:43:10,163 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 23 states. [2018-02-02 08:43:12,027 WARN L143 SmtUtils]: Spent 1610ms on a formula simplification that was a NOOP. DAG size: 49 [2018-02-02 08:43:14,620 WARN L143 SmtUtils]: Spent 2556ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-02 08:43:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:14,884 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-02-02 08:43:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:43:14,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-02 08:43:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:14,886 INFO L225 Difference]: With dead ends: 90 [2018-02-02 08:43:14,886 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 08:43:14,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:43:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 08:43:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-02 08:43:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 08:43:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-02 08:43:14,889 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2018-02-02 08:43:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:14,890 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-02 08:43:14,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:43:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-02 08:43:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:43:14,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:14,890 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, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:14,890 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1058376373, now seen corresponding path program 1 times [2018-02-02 08:43:14,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:14,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:14,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:14,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:14,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:14,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:14,959 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-02 08:43:14,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:43:14,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:43:14,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:43:14,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:43:14,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:43:14,961 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 10 states. [2018-02-02 08:43:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:15,074 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-02 08:43:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:43:15,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 08:43:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:15,075 INFO L225 Difference]: With dead ends: 62 [2018-02-02 08:43:15,075 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:43:15,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:43:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:43:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-02 08:43:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 08:43:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-02-02 08:43:15,077 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-02-02 08:43:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:15,077 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-02-02 08:43:15,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:43:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-02-02 08:43:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:43:15,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:15,078 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:15,078 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:15,078 INFO L82 PathProgramCache]: Analyzing trace with hash 532181010, now seen corresponding path program 1 times [2018-02-02 08:43:15,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:15,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:15,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:15,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:15,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:15,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:15,337 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-02 08:43:15,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:15,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:43:15,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:15,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:15,379 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-02 08:43:15,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:43:15,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:15,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:15,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:43:15,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:43:15,427 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 14 treesize of output 11 [2018-02-02 08:43:15,428 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-02 08:43:15,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:43:15,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:43:15,459 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 25 treesize of output 26 [2018-02-02 08:43:15,461 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-02 08:43:15,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:15,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 08:43:15,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:43:18,428 WARN L143 SmtUtils]: Spent 684ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-02 08:43:18,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-02-02 08:43:18,510 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 45 treesize of output 43 [2018-02-02 08:43:18,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:18,566 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 37 treesize of output 35 [2018-02-02 08:43:18,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:18,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-02 08:43:18,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,651 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 27 treesize of output 19 [2018-02-02 08:43:18,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-02-02 08:43:18,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-02 08:43:18,781 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 35 treesize of output 27 [2018-02-02 08:43:18,781 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,783 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 31 treesize of output 23 [2018-02-02 08:43:18,784 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,851 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 35 treesize of output 27 [2018-02-02 08:43:18,851 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,852 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 34 treesize of output 26 [2018-02-02 08:43:18,852 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,854 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 31 treesize of output 23 [2018-02-02 08:43:18,854 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 16 [2018-02-02 08:43:18,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 20 [2018-02-02 08:43:18,896 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:18,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-02 08:43:19,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 08:43:19,009 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-02 08:43:19,089 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-02 08:43:19,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:19,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-02-02 08:43:19,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 08:43:19,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 08:43:19,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:43:19,108 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 29 states. [2018-02-02 08:43:20,926 WARN L146 SmtUtils]: Spent 1265ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-02-02 08:43:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:21,553 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-02 08:43:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:43:21,554 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-02-02 08:43:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:21,554 INFO L225 Difference]: With dead ends: 124 [2018-02-02 08:43:21,554 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 08:43:21,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:43:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 08:43:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-02-02 08:43:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 08:43:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-02-02 08:43:21,558 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 33 [2018-02-02 08:43:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:21,558 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-02-02 08:43:21,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 08:43:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-02-02 08:43:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 08:43:21,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:21,558 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, 1, 1, 1, 1, 1] [2018-02-02 08:43:21,559 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:21,559 INFO L82 PathProgramCache]: Analyzing trace with hash -360199549, now seen corresponding path program 1 times [2018-02-02 08:43:21,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:21,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:21,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:21,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:21,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:21,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:21,870 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-02 08:43:21,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:21,871 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:43:21,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:21,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:21,902 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-02 08:43:21,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:21,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:21,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:43:21,919 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 15 treesize of output 12 [2018-02-02 08:43:21,924 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-02 08:43:21,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:21,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:21,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-02 08:43:22,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 08:43:22,030 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 15 treesize of output 12 [2018-02-02 08:43:22,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:22,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:43:22,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:43:22,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-02 08:43:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:22,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:22,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-02-02 08:43:22,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:43:22,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:43:22,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:43:22,125 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 22 states. [2018-02-02 08:43:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:22,770 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-02-02 08:43:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:43:22,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-02-02 08:43:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:22,771 INFO L225 Difference]: With dead ends: 108 [2018-02-02 08:43:22,771 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 08:43:22,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 08:43:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 08:43:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2018-02-02 08:43:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:43:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-02 08:43:22,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 37 [2018-02-02 08:43:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:22,773 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-02 08:43:22,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:43:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-02 08:43:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:43:22,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:22,774 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:22,774 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1944116138, now seen corresponding path program 2 times [2018-02-02 08:43:22,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:22,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:22,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:22,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:22,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:22,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:23,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:23,089 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 08:43:23,094 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:43:23,104 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:43:23,112 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:43:23,115 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:43:23,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:23,123 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-02 08:43:23,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,128 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-02 08:43:23,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:43:23,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:23,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:23,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:43:23,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:43:23,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-02 08:43:23,242 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 16 treesize of output 13 [2018-02-02 08:43:23,244 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-02 08:43:23,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-02 08:43:23,277 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 29 treesize of output 30 [2018-02-02 08:43:23,278 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-02 08:43:23,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-02 08:43:23,771 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 46 treesize of output 40 [2018-02-02 08:43:23,778 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 16 treesize of output 13 [2018-02-02 08:43:23,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:23,788 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 21 treesize of output 13 [2018-02-02 08:43:23,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:23,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:43:23,809 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 2 xjuncts. [2018-02-02 08:43:23,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-02 08:43:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:43:23,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:23,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-02 08:43:23,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 08:43:23,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 08:43:23,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:43:23,950 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 33 states. [2018-02-02 08:43:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:27,891 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-02 08:43:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 08:43:27,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-02 08:43:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:27,892 INFO L225 Difference]: With dead ends: 123 [2018-02-02 08:43:27,892 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 08:43:27,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=840, Invalid=5322, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 08:43:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 08:43:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. [2018-02-02 08:43:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 08:43:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-02-02 08:43:27,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 48 [2018-02-02 08:43:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:27,895 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-02-02 08:43:27,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 08:43:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-02-02 08:43:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 08:43:27,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:43:27,897 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:43:27,897 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 08:43:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2133346040, now seen corresponding path program 1 times [2018-02-02 08:43:27,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:43:27,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:43:27,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,898 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:43:27,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:43:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:27,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:43:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 08:43:28,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:43:28,125 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 08:43:28,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:43:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:43:28,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:43:28,153 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-02 08:43:28,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,158 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-02 08:43:28,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:43:28,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:28,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:43:28,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:43:28,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:43:28,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 08:43:28,222 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 16 treesize of output 13 [2018-02-02 08:43:28,224 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-02 08:43:28,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:43:28,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 08:43:28,251 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 29 treesize of output 30 [2018-02-02 08:43:28,253 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-02 08:43:28,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:43:28,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:43:28,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-02 08:43:34,531 WARN L143 SmtUtils]: Spent 2041ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-02 08:43:34,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-02-02 08:43:34,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 49 treesize of output 42 [2018-02-02 08:43:34,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:34,632 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 41 treesize of output 39 [2018-02-02 08:43:34,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:34,668 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 41 treesize of output 31 [2018-02-02 08:43:34,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:34,709 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 38 treesize of output 28 [2018-02-02 08:43:34,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:34,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-02-02 08:43:34,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-02 08:43:34,814 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 28 treesize of output 26 [2018-02-02 08:43:34,814 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 08:43:34,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-02-02 08:43:34,874 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 08:43:34,952 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 35 treesize of output 27 [2018-02-02 08:43:34,952 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:34,954 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 29 treesize of output 21 [2018-02-02 08:43:34,954 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 08:43:35,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-02 08:43:35,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-02 08:43:35,054 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:67, output treesize:106 [2018-02-02 08:43:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 59 proven. 10 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:43:35,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:43:35,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-02 08:43:35,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 08:43:35,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 08:43:35,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=917, Unknown=1, NotChecked=0, Total=1056 [2018-02-02 08:43:35,199 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 33 states. [2018-02-02 08:43:41,277 WARN L146 SmtUtils]: Spent 4096ms on a formula simplification. DAG size of input: 65 DAG size of output 57 [2018-02-02 08:43:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:43:42,073 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-02 08:43:42,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 08:43:42,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-02-02 08:43:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:43:42,074 INFO L225 Difference]: With dead ends: 98 [2018-02-02 08:43:42,074 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:43:42,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=891, Invalid=3398, Unknown=1, NotChecked=0, Total=4290 [2018-02-02 08:43:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:43:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:43:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:43:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:43:42,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-02-02 08:43:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:43:42,075 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:43:42,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 08:43:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:43:42,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:43:42,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:43:42 BoogieIcfgContainer [2018-02-02 08:43:42,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:43:42,079 INFO L168 Benchmark]: Toolchain (without parser) took 34480.43 ms. Allocated memory was 398.5 MB in the beginning and 766.5 MB in the end (delta: 368.1 MB). Free memory was 356.7 MB in the beginning and 436.6 MB in the end (delta: -80.0 MB). Peak memory consumption was 288.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:42,080 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:43:42,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.88 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:42,081 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 398.5 MB. Free memory was 344.7 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:42,081 INFO L168 Benchmark]: RCFGBuilder took 195.58 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 322.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:42,081 INFO L168 Benchmark]: TraceAbstraction took 34108.93 ms. Allocated memory was 398.5 MB in the beginning and 766.5 MB in the end (delta: 368.1 MB). Free memory was 322.7 MB in the beginning and 436.6 MB in the end (delta: -113.9 MB). Peak memory consumption was 254.2 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:42,082 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 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.88 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.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 21.38 ms. Allocated memory is still 398.5 MB. Free memory was 344.7 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 195.58 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 322.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 34108.93 ms. Allocated memory was 398.5 MB in the beginning and 766.5 MB in the end (delta: 368.1 MB). Free memory was 322.7 MB in the beginning and 436.6 MB in the end (delta: -113.9 MB). Peak memory consumption was 254.2 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 34.0s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 621 SDtfs, 1801 SDslu, 2823 SDs, 0 SdLazy, 3922 SolverSat, 375 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=13, 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, 16 MinimizatonAttempts, 198 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 638 ConstructedInterpolants, 106 QuantifiedInterpolants, 465412 SizeOfPredicates, 76 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 94/216 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/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-43-42-088.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-43-42-088.csv Received shutdown request...