java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:02:57,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:02:57,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:02:57,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:02:57,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:02:57,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:02:57,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:02:57,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:02:57,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:02:57,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:02:57,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:02:57,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:02:57,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:02:57,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:02:57,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:02:57,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:02:57,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:02:57,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:02:57,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:02:57,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:02:57,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:02:57,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:02:57,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:02:57,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:02:57,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:02:57,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:02:57,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:02:57,936 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:02:57,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:02:57,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:02:57,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:02:57,937 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 09:02:57,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:02:57,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:02:57,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:02:57,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:02:57,944 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:02:57,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:02:57,945 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:02:57,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:02:57,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:02:57,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:02:57,947 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:02:57,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:02:57,947 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:02:57,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:02:57,984 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:02:57,987 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:02:57,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:02:57,989 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:02:57,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-02 09:02:58,156 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:02:58,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:02:58,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:02:58,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:02:58,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:02:58,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21938c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58, skipping insertion in model container [2018-02-02 09:02:58,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,180 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:02:58,212 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:02:58,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:02:58,316 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:02:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58 WrapperNode [2018-02-02 09:02:58,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:02:58,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:02:58,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:02:58,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:02:58,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (1/1) ... [2018-02-02 09:02:58,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:02:58,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:02:58,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:02:58,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:02:58,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (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 09:02:58,407 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:02:58,408 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:02:58,408 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 09:02:58,408 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-02 09:02:58,408 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-02 09:02:58,408 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:02:58,409 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:02:58,517 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 09:02:58,609 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:02:58,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:02:58 BoogieIcfgContainer [2018-02-02 09:02:58,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:02:58,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:02:58,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:02:58,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:02:58,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:02:58" (1/3) ... [2018-02-02 09:02:58,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea9f93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:02:58, skipping insertion in model container [2018-02-02 09:02:58,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:58" (2/3) ... [2018-02-02 09:02:58,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea9f93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:02:58, skipping insertion in model container [2018-02-02 09:02:58,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:02:58" (3/3) ... [2018-02-02 09:02:58,614 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-02 09:02:58,619 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:02:58,624 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 09:02:58,646 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:02:58,646 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:02:58,646 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:02:58,646 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:02:58,646 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:02:58,646 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:02:58,646 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:02:58,646 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:02:58,647 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:02:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-02 09:02:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 09:02:58,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:58,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 09:02:58,661 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-02 09:02:58,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:58,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:58,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:58,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:58,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:58,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:58,764 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 09:02:58,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:58,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:58,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:58,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:58,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:58,778 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-02 09:02:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:58,895 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 09:02:58,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:58,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 09:02:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:58,907 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:02:58,907 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 09:02:58,909 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 09:02:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 09:02:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 09:02:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:02:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-02 09:02:58,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-02 09:02:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:58,991 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-02 09:02:58,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-02 09:02:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 09:02:58,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:58,992 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 09:02:58,992 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-02 09:02:58,992 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:58,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:58,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:58,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:58,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,044 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 09:02:59,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:59,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:59,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:59,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:59,046 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-02 09:02:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,102 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 09:02:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:59,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 09:02:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,104 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:02:59,104 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 09:02:59,105 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 09:02:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 09:02:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 09:02:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:02:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 09:02:59,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-02 09:02:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,110 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 09:02:59,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 09:02:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:02:59,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,111 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,111 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-02 09:02:59,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,192 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 09:02:59,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:59,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:59,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:59,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:59,193 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-02 09:02:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,234 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-02 09:02:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:59,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-02 09:02:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,235 INFO L225 Difference]: With dead ends: 51 [2018-02-02 09:02:59,235 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:02:59,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 09:02:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:02:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 09:02:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:02:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-02 09:02:59,239 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-02 09:02:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,239 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-02 09:02:59,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-02 09:02:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:02:59,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,240 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-02 09:02:59,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,301 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 09:02:59,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:02:59,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:02:59,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:02:59,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:02:59,302 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-02 09:02:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,341 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-02 09:02:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:02:59,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:02:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,342 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:02:59,342 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:02:59,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:02:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:02:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 09:02:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:02:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 09:02:59,345 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-02 09:02:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,345 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 09:02:59,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:02:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 09:02:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:02:59,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,346 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-02 09:02:59,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,488 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 09:02:59,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:02:59,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:02:59,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:02:59,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:02:59,489 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 5 states. [2018-02-02 09:02:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,576 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-02 09:02:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:02:59,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 09:02:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,577 INFO L225 Difference]: With dead ends: 47 [2018-02-02 09:02:59,577 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 09:02:59,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:02:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 09:02:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 09:02:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:02:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-02 09:02:59,581 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-02 09:02:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,581 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-02 09:02:59,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:02:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-02 09:02:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:02:59,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,582 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,583 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-02 09:02:59,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,617 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 09:02:59,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:59,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:59,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:59,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:59,619 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 3 states. [2018-02-02 09:02:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,651 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-02 09:02:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:59,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 09:02:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,652 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:02:59,652 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:02:59,652 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 09:02:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:02:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 09:02:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 09:02:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-02 09:02:59,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 27 [2018-02-02 09:02:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,656 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-02 09:02:59,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-02 09:02:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:02:59,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,657 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,657 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-02 09:02:59,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,735 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 09:02:59,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:02:59,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:02:59,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:02:59,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:02:59,736 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-02-02 09:02:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,869 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-02 09:02:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:02:59,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 09:02:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,870 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:02:59,870 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:02:59,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:02:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:02:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 09:02:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:02:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-02 09:02:59,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-02-02 09:02:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,874 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-02 09:02:59,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:02:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-02 09:02:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:02:59,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,877 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-02-02 09:02:59,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:02:59,923 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 09:02:59,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:02:59,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:02:59,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:02:59,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:02:59,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:02:59,925 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2018-02-02 09:02:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:02:59,947 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-02 09:02:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:02:59,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 09:02:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:02:59,948 INFO L225 Difference]: With dead ends: 42 [2018-02-02 09:02:59,948 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 09:02:59,949 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 09:02:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 09:02:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 09:02:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 09:02:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-02 09:02:59,950 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 27 [2018-02-02 09:02:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:02:59,951 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-02 09:02:59,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:02:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-02 09:02:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:02:59,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:02:59,952 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:02:59,952 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:02:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1677513941, now seen corresponding path program 1 times [2018-02-02 09:02:59,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:02:59,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:02:59,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:02:59,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:02:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:02:59,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:03:00,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:03:00,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:03:00,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:03:00,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:03:00,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:03:00,016 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-02-02 09:03:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:03:00,033 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-02 09:03:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:03:00,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 09:03:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:03:00,034 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:03:00,034 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:03:00,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:03:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:03:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 09:03:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:03:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-02 09:03:00,036 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-02-02 09:03:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:03:00,037 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-02 09:03:00,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:03:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-02 09:03:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:03:00,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:03:00,038 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:03:00,038 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:03:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -656412319, now seen corresponding path program 1 times [2018-02-02 09:03:00,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:03:00,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:03:00,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:03:00,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:00,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:03:00,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:03:00,101 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 09:03:00,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:03:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:00,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:03:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:03:00,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:03:00,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-02-02 09:03:00,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:03:00,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:03:00,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:03:00,203 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 8 states. [2018-02-02 09:03:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:03:00,229 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-02 09:03:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:03:00,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-02 09:03:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:03:00,231 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:03:00,231 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:03:00,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:03:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:03:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 09:03:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 09:03:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-02 09:03:00,234 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-02-02 09:03:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:03:00,234 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-02 09:03:00,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:03:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-02 09:03:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:03:00,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:03:00,236 INFO L351 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:03:00,236 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:03:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 2 times [2018-02-02 09:03:00,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:03:00,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:03:00,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:03:00,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:00,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:03:00,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:03:00,357 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 09:03:00,366 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:03:00,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:03:00,416 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:03:00,420 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:03:00,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:03:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:03:00,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:03:00,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-02-02 09:03:00,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:03:00,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:03:00,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:03:00,475 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-02-02 09:03:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:03:00,514 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-02 09:03:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:03:00,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-02 09:03:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:03:00,515 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:03:00,515 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 09:03:00,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:03:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 09:03:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 09:03:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 09:03:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-02 09:03:00,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-02-02 09:03:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:03:00,518 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-02 09:03:00,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:03:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-02 09:03:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:03:00,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:03:00,519 INFO L351 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:03:00,519 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:03:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 3 times [2018-02-02 09:03:00,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:03:00,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:03:00,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,520 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:03:00,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:00,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 09:03:00,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:03:00,598 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:03:00,604 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:03:00,632 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:03:00,650 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:03:00,685 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:03:00,686 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:03:00,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:03:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 09:03:00,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:03:00,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-02 09:03:00,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:03:00,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:03:00,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:03:00,751 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-02-02 09:03:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:03:00,780 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-02 09:03:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:03:00,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 09:03:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:03:00,781 INFO L225 Difference]: With dead ends: 54 [2018-02-02 09:03:00,781 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:03:00,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:03:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:03:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 09:03:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:03:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-02 09:03:00,783 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-02-02 09:03:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:03:00,783 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-02 09:03:00,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:03:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-02 09:03:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:03:00,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:03:00,784 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:03:00,784 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:03:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 4 times [2018-02-02 09:03:00,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:03:00,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:03:00,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,785 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:03:00,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:00,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:03:01,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:03:01,461 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:03:01,466 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 09:03:01,510 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:03:01,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:03:01,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:03:01,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:03:01,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:01,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:01,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:01,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-02 09:03:08,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-02-02 09:03:08,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-02-02 09:03:08,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-02-02 09:03:08,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-02-02 09:03:08,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:08,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-02-02 09:03:08,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:08,402 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-02 09:03:08,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-02 09:03:08,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:08,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-02-02 09:03:10,727 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-02-02 09:03:10,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-02-02 09:03:10,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-02-02 09:03:10,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-02-02 09:03:10,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-02-02 09:03:10,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-02-02 09:03:10,773 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:10,824 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-02 09:03:10,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2018-02-02 09:03:10,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2018-02-02 09:03:10,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:10,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:3 [2018-02-02 09:03:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 32 refuted. 11 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:03:10,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:03:10,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-02-02 09:03:10,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 09:03:10,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 09:03:10,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1075, Unknown=14, NotChecked=0, Total=1260 [2018-02-02 09:03:10,942 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-02-02 09:03:24,590 WARN L146 SmtUtils]: Spent 946ms on a formula simplification. DAG size of input: 84 DAG size of output 62 [2018-02-02 09:03:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:03:34,966 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-02 09:03:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:03:34,966 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-02 09:03:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:03:34,969 INFO L225 Difference]: With dead ends: 97 [2018-02-02 09:03:34,969 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:03:34,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=426, Invalid=2852, Unknown=28, NotChecked=0, Total=3306 [2018-02-02 09:03:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:03:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-02-02 09:03:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:03:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-02-02 09:03:34,979 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 43 [2018-02-02 09:03:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:03:34,979 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-02-02 09:03:34,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 09:03:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-02-02 09:03:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:03:34,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:03:34,981 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:03:34,981 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 09:03:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-02 09:03:34,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:03:34,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:03:34,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:34,982 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:03:34,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:03:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:35,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:03:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:03:35,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:03:35,756 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:03:35,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:03:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:03:35,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:03:35,807 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 09:03:35,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 09:03:35,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:35,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:35,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 09:03:35,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 09:03:35,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:03:35,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:03:35,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:35,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 09:03:35,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-02 09:03:35,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-02 09:03:35,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:35,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:35,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:35,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-02 09:03:36,542 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-02-02 09:03:36,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2018-02-02 09:03:36,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-02-02 09:03:36,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-02-02 09:03:36,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-02-02 09:03:36,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 105 [2018-02-02 09:03:36,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:36,687 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-02-02 09:03:36,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-02-02 09:03:36,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:36,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-02-02 09:03:36,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-02 09:03:36,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 09:03:36,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 09:03:36,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-02-02 09:03:36,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2018-02-02 09:03:36,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:36,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-02-02 09:03:36,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:36,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-02-02 09:03:36,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:36,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-02 09:03:36,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:37,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:03:37,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-02-02 09:03:37,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:03:37,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-02-02 09:03:37,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:03:37,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-02 09:03:37,097 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:37,113 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-02-02 09:03:37,114 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:03:37,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:03:37,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-02-02 09:03:37,176 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-02-02 09:03:37,460 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 34 DAG size of output 30 Received shutdown request... [2018-02-02 09:04:15,377 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 09:04:15,377 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:04:15,380 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:04:15,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:04:15 BoogieIcfgContainer [2018-02-02 09:04:15,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:04:15,381 INFO L168 Benchmark]: Toolchain (without parser) took 77224.48 ms. Allocated memory was 400.0 MB in the beginning and 748.2 MB in the end (delta: 348.1 MB). Free memory was 354.1 MB in the beginning and 688.4 MB in the end (delta: -334.3 MB). Peak memory consumption was 310.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:04:15,382 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.0 MB. Free memory is still 359.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:04:15,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.92 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 343.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:04:15,382 INFO L168 Benchmark]: Boogie Preprocessor took 31.52 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:04:15,382 INFO L168 Benchmark]: RCFGBuilder took 254.03 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 318.2 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:04:15,383 INFO L168 Benchmark]: TraceAbstraction took 76770.37 ms. Allocated memory was 400.0 MB in the beginning and 748.2 MB in the end (delta: 348.1 MB). Free memory was 318.2 MB in the beginning and 688.4 MB in the end (delta: -370.1 MB). Peak memory consumption was 274.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:04:15,383 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.14 ms. Allocated memory is still 400.0 MB. Free memory is still 359.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.92 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 343.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.52 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 254.03 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 318.2 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76770.37 ms. Allocated memory was 400.0 MB in the beginning and 748.2 MB in the end (delta: 348.1 MB). Free memory was 318.2 MB in the beginning and 688.4 MB in the end (delta: -370.1 MB). Peak memory consumption was 274.1 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 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 76.7s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 452 SDtfs, 307 SDslu, 1021 SDs, 0 SdLazy, 830 SolverSat, 136 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 148 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 487 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 470 ConstructedInterpolants, 12 QuantifiedInterpolants, 134117 SizeOfPredicates, 11 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 82/225 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/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-04-15-388.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-04-15-388.csv Completed graceful shutdown