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/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:42:04,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:42:04,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:42:04,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:42:04,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:42:04,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:42:04,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:42:04,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:42:04,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:42:04,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:42:04,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:42:04,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:42:04,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:42:04,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:42:04,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:42:04,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:42:04,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:42:04,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:42:04,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:42:04,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:42:04,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:42:04,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:42:04,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:42:04,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:42:04,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:42:04,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:42:04,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:42:04,918 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:42:04,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:42:04,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:42:04,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:42:04,920 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:42:04,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:42:04,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:42:04,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:42:04,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:42:04,932 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:42:04,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:42:04,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:42:04,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:42:04,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:42:04,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:42:04,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:42:04,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:42:04,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:42:04,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:42:04,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:42:04,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:42:04,935 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:42:04,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:42:04,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:42:04,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:42:04,972 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:42:04,975 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:42:04,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:42:04,977 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:42:04,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:42:05,147 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:42:05,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:42:05,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:42:05,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:42:05,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:42:05,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcbc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05, skipping insertion in model container [2018-02-02 08:42:05,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,172 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:42:05,200 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:42:05,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:42:05,295 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:42:05,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05 WrapperNode [2018-02-02 08:42:05,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:42:05,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:42:05,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:42:05,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:42:05,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... [2018-02-02 08:42:05,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:42:05,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:42:05,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:42:05,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:42:05,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:42:05,356 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:42:05,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:42:05,378 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-02 08:42:05,378 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:42:05,379 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:42:05,380 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:42:05,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:42:05,564 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:42:05,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:05 BoogieIcfgContainer [2018-02-02 08:42:05,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:42:05,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:42:05,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:42:05,567 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:42:05,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:42:05" (1/3) ... [2018-02-02 08:42:05,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4b0cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:05, skipping insertion in model container [2018-02-02 08:42:05,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:05" (2/3) ... [2018-02-02 08:42:05,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4b0cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:05, skipping insertion in model container [2018-02-02 08:42:05,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:05" (3/3) ... [2018-02-02 08:42:05,570 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:42:05,575 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:42:05,580 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 08:42:05,604 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:42:05,604 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:42:05,604 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:42:05,605 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:42:05,605 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:42:05,605 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:42:05,605 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:42:05,605 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:42:05,605 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:42:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-02 08:42:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 08:42:05,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:05,621 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:05,621 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1927484354, now seen corresponding path program 1 times [2018-02-02 08:42:05,629 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:05,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:05,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:05,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:05,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:05,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:05,788 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:42:05,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:05,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:42:05,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:42:05,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:42:05,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:05,808 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-02-02 08:42:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:05,902 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-02 08:42:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:42:05,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 08:42:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:05,983 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:42:05,984 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 08:42:05,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 08:42:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 08:42:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 08:42:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 08:42:06,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-02-02 08:42:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,010 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 08:42:06,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:42:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 08:42:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:42:06,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,010 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1621249811, now seen corresponding path program 1 times [2018-02-02 08:42:06,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,063 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:42:06,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:42:06,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:06,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:06,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:06,066 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-02-02 08:42:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,113 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-02 08:42:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:42:06,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 08:42:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,114 INFO L225 Difference]: With dead ends: 58 [2018-02-02 08:42:06,114 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 08:42:06,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:42:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 08:42:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 08:42:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 08:42:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-02 08:42:06,118 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-02-02 08:42:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,118 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-02 08:42:06,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-02 08:42:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:42:06,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,119 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659115, now seen corresponding path program 1 times [2018-02-02 08:42:06,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,179 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:42:06,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:06,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:42:06,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:42:06,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:42:06,180 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2018-02-02 08:42:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,238 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 08:42:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:42:06,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 08:42:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,239 INFO L225 Difference]: With dead ends: 54 [2018-02-02 08:42:06,239 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 08:42:06,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 08:42:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 08:42:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 08:42:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 08:42:06,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-02-02 08:42:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,242 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 08:42:06,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:42:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 08:42:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:42:06,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,243 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659114, now seen corresponding path program 1 times [2018-02-02 08:42:06,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,358 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:42:06,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:42:06,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:42:06,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:42:06,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:42:06,359 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-02-02 08:42:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,436 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-02 08:42:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:42:06,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 08:42:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,437 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:42:06,437 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 08:42:06,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:42:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 08:42:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 08:42:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:42:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-02 08:42:06,441 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-02-02 08:42:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,441 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-02 08:42:06,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:42:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-02 08:42:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:42:06,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,442 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,442 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890416, now seen corresponding path program 1 times [2018-02-02 08:42:06,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,477 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:42:06,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:06,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:42:06,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:42:06,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:42:06,478 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-02 08:42:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,517 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-02 08:42:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:42:06,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:42:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,518 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:42:06,518 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:42:06,518 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:42:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:42:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:42:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:42:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-02 08:42:06,522 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-02-02 08:42:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,523 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-02 08:42:06,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:42:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-02 08:42:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:42:06,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,523 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,523 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890415, now seen corresponding path program 1 times [2018-02-02 08:42:06,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,580 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:42:06,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:42:06,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:06,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:06,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:06,582 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-02 08:42:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,605 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-02 08:42:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:42:06,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 08:42:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,606 INFO L225 Difference]: With dead ends: 51 [2018-02-02 08:42:06,606 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 08:42:06,606 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:42:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 08:42:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 08:42:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 08:42:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-02 08:42:06,610 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-02-02 08:42:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,610 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-02 08:42:06,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-02 08:42:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:42:06,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,611 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,611 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382581, now seen corresponding path program 1 times [2018-02-02 08:42:06,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,662 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:42:06,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:42:06,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:06,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:06,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:06,663 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-02 08:42:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,714 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-02 08:42:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:42:06,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 08:42:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,715 INFO L225 Difference]: With dead ends: 47 [2018-02-02 08:42:06,715 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:42:06,716 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:42:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:42:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:42:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:42:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-02 08:42:06,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-02-02 08:42:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,718 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-02 08:42:06,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-02 08:42:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:42:06,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,718 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:06,718 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382582, now seen corresponding path program 1 times [2018-02-02 08:42:06,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:06,802 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:42:06,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:06,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:42:06,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:42:06,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:42:06,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:42:06,803 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-02-02 08:42:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:06,945 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-02-02 08:42:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:42:06,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 08:42:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:06,948 INFO L225 Difference]: With dead ends: 65 [2018-02-02 08:42:06,948 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 08:42:06,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:42:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 08:42:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-02 08:42:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 08:42:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-02-02 08:42:06,951 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-02-02 08:42:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:06,951 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-02-02 08:42:06,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:42:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-02-02 08:42:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:42:06,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:06,951 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] [2018-02-02 08:42:06,951 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1818413707, now seen corresponding path program 1 times [2018-02-02 08:42:06,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:06,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:06,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:06,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:06,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:07,106 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:42:07,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:07,106 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:42:07,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:07,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42:07,217 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:42:07,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,223 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:42:07,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-02 08:42:07,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:07,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:07,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-02 08:42:07,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:07,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:07,275 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:42:07,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:07,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-02 08:42:07,399 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:42:07,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:07,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-02 08:42:07,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:42:07,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:42:07,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:42:07,417 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 22 states. [2018-02-02 08:42:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:07,798 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-02-02 08:42:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:42:07,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-02-02 08:42:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:07,799 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:42:07,799 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:42:07,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:42:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:42:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-02-02 08:42:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 08:42:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-02-02 08:42:07,804 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2018-02-02 08:42:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:07,804 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-02-02 08:42:07,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:42:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-02-02 08:42:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:42:07,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:07,805 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] [2018-02-02 08:42:07,806 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -557502487, now seen corresponding path program 1 times [2018-02-02 08:42:07,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:07,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:07,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:07,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:07,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:07,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:07,847 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:42:07,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:07,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:42:07,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:42:07,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:42:07,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:42:07,848 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 6 states. [2018-02-02 08:42:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:07,884 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-02-02 08:42:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:42:07,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 08:42:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:07,886 INFO L225 Difference]: With dead ends: 72 [2018-02-02 08:42:07,887 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 08:42:07,887 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:42:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 08:42:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-02-02 08:42:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 08:42:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-02-02 08:42:07,891 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 25 [2018-02-02 08:42:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:07,891 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-02-02 08:42:07,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:42:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-02-02 08:42:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:42:07,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:07,892 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] [2018-02-02 08:42:07,892 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash -557502486, now seen corresponding path program 1 times [2018-02-02 08:42:07,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:07,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:07,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:07,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:07,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:07,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:07,980 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:42:07,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:07,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:42:07,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:42:07,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:42:07,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:42:07,981 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-02-02 08:42:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:08,072 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-02-02 08:42:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:42:08,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-02 08:42:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:08,073 INFO L225 Difference]: With dead ends: 98 [2018-02-02 08:42:08,073 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 08:42:08,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:42:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 08:42:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-02-02 08:42:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 08:42:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-02-02 08:42:08,077 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 25 [2018-02-02 08:42:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:08,077 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-02-02 08:42:08,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:42:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2018-02-02 08:42:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:42:08,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:08,077 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:08,077 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-02 08:42:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -59760490, now seen corresponding path program 2 times [2018-02-02 08:42:08,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:08,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:08,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:08,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:08,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:08,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:08,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:08,288 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:42:08,294 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:42:08,305 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:08,308 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:08,309 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:42:08,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42:08,337 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:42:08,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-02 08:42:08,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:08,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:08,375 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:42:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-02 08:42:08,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 17 treesize of output 14 [2018-02-02 08:42:08,429 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 14 treesize of output 13 [2018-02-02 08:42:08,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:42:08,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-02-02 08:42:08,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-02 08:42:08,472 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:42:08,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:08,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-02 08:42:08,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-02-02 08:42:10,641 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 41 treesize of output 37 [2018-02-02 08:42:10,655 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:42:10,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:10,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:10,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 08:42:10,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:10,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:10,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:10,687 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-02-02 08:42:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:10,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:10,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-02 08:42:10,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:42:10,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:42:10,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=586, Unknown=1, NotChecked=0, Total=650 [2018-02-02 08:42:10,747 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 26 states. [2018-02-02 08:42:34,351 WARN L146 SmtUtils]: Spent 8054ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-02-02 08:42:38,563 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 74 DAG size of output 65 [2018-02-02 08:42:59,727 WARN L146 SmtUtils]: Spent 8059ms on a formula simplification. DAG size of input: 72 DAG size of output 67 [2018-02-02 08:43:03,937 WARN L146 SmtUtils]: Spent 4149ms on a formula simplification. DAG size of input: 81 DAG size of output 63 [2018-02-02 08:43:10,903 WARN L146 SmtUtils]: Spent 4164ms on a formula simplification. DAG size of input: 61 DAG size of output 50 [2018-02-02 08:43:16,920 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 70 DAG size of output 53 Received shutdown request... [2018-02-02 08:43:24,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 08:43:24,144 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:43:24,342 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:43:24,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:43:24 BoogieIcfgContainer [2018-02-02 08:43:24,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:43:24,343 INFO L168 Benchmark]: Toolchain (without parser) took 79195.35 ms. Allocated memory was 401.1 MB in the beginning and 707.8 MB in the end (delta: 306.7 MB). Free memory was 359.3 MB in the beginning and 603.9 MB in the end (delta: -244.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:24,344 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:43:24,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.07 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.3 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:24,344 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 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:24,345 INFO L168 Benchmark]: RCFGBuilder took 242.38 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 324.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:24,345 INFO L168 Benchmark]: TraceAbstraction took 78777.53 ms. Allocated memory was 401.1 MB in the beginning and 707.8 MB in the end (delta: 306.7 MB). Free memory was 324.0 MB in the beginning and 603.9 MB in the end (delta: -279.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:43:24,346 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 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.07 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.13 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.38 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 324.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78777.53 ms. Allocated memory was 401.1 MB in the beginning and 707.8 MB in the end (delta: 306.7 MB). Free memory was 324.0 MB in the beginning and 603.9 MB in the end (delta: -279.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 29 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (100 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 78.7s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 74.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 553 SDtfs, 947 SDslu, 1833 SDs, 0 SdLazy, 1332 SolverSat, 202 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 53.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=11, 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, 11 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 262 ConstructedInterpolants, 17 QuantifiedInterpolants, 41937 SizeOfPredicates, 25 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-43-24-352.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-43-24-352.csv Completed graceful shutdown