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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:14:05,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:14:05,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:14:05,870 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:14:05,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:14:05,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:14:05,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:14:05,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:14:05,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:14:05,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:14:05,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:14:05,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:14:05,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:14:05,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:14:05,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:14:05,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:14:05,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:14:05,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:14:05,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:14:05,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:14:05,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:14:05,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:14:05,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:14:05,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:14:05,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:14:05,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:14:05,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:14:05,897 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:14:05,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:14:05,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:14:05,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:14:05,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:14:05,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:14:05,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:14:05,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:14:05,908 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:14:05,908 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:14:05,908 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:14:05,908 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:14:05,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:14:05,909 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:14:05,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:14:05,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:14:05,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:14:05,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:14:05,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:14:05,910 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:14:05,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:14:05,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:14:05,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:14:05,911 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:14:05,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:14:05,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:14:05,912 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:14:05,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:14:05,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:14:05,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:14:05,913 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:14:05,913 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:14:05,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:14:05,955 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:14:05,958 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:14:05,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:14:05,960 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:14:05,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i [2018-01-24 13:14:06,114 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:14:06,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:14:06,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:14:06,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:14:06,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:14:06,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69156849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06, skipping insertion in model container [2018-01-24 13:14:06,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,142 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:14:06,180 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:14:06,300 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:14:06,318 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:14:06,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06 WrapperNode [2018-01-24 13:14:06,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:14:06,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:14:06,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:14:06,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:14:06,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... [2018-01-24 13:14:06,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:14:06,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:14:06,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:14:06,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:14:06,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (1/1) ... No working directory specified, using /storage/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-01-24 13:14:06,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:14:06,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:14:06,410 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:14:06,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:14:06,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:14:06,410 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:14:06,411 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:14:06,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:14:06,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:14:06,635 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:14:06,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:14:06 BoogieIcfgContainer [2018-01-24 13:14:06,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:14:06,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:14:06,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:14:06,639 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:14:06,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:14:06" (1/3) ... [2018-01-24 13:14:06,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:14:06, skipping insertion in model container [2018-01-24 13:14:06,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:14:06" (2/3) ... [2018-01-24 13:14:06,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:14:06, skipping insertion in model container [2018-01-24 13:14:06,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:14:06" (3/3) ... [2018-01-24 13:14:06,641 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-deref.i [2018-01-24 13:14:06,648 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:14:06,654 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 13:14:06,697 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:14:06,698 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:14:06,698 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:14:06,698 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:14:06,698 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:14:06,698 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:14:06,698 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:14:06,698 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:14:06,699 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:14:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 13:14:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:14:06,721 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:06,722 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:06,722 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-24 13:14:06,728 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:06,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:06,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:06,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:06,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:06,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:06,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:06,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:14:06,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:06,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:14:06,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:14:06,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:14:06,894 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-24 13:14:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:06,920 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 13:14:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:14:06,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 13:14:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:06,930 INFO L225 Difference]: With dead ends: 103 [2018-01-24 13:14:06,930 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 13:14:06,933 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:14:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 13:14:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 13:14:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 13:14:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 13:14:07,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-24 13:14:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:07,049 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 13:14:07,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:14:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 13:14:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:14:07,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:07,050 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:07,050 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-24 13:14:07,050 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:07,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:07,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:07,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:07,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:07,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:14:07,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:07,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:14:07,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:14:07,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:14:07,148 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-24 13:14:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:07,245 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-24 13:14:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:14:07,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:14:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:07,247 INFO L225 Difference]: With dead ends: 53 [2018-01-24 13:14:07,247 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 13:14:07,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 13:14:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 13:14:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 13:14:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 13:14:07,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-24 13:14:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:07,256 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 13:14:07,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:14:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 13:14:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:14:07,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:07,257 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:07,257 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-24 13:14:07,257 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:07,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:07,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:07,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:07,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:07,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:14:07,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:07,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:14:07,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:14:07,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:07,386 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 13:14:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:07,514 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-24 13:14:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:14:07,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 13:14:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:07,517 INFO L225 Difference]: With dead ends: 52 [2018-01-24 13:14:07,517 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 13:14:07,517 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:14:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 13:14:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 13:14:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 13:14:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 13:14:07,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-24 13:14:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:07,524 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 13:14:07,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:14:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 13:14:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:14:07,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:07,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:07,525 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-24 13:14:07,526 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:07,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:07,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:07,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:07,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:07,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:14:07,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:07,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:14:07,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:14:07,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:14:07,628 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-24 13:14:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:07,744 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 13:14:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:14:07,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 13:14:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:07,746 INFO L225 Difference]: With dead ends: 51 [2018-01-24 13:14:07,746 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 13:14:07,746 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:14:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 13:14:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 13:14:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 13:14:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 13:14:07,753 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-24 13:14:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:07,753 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 13:14:07,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:14:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 13:14:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:14:07,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:07,754 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:07,754 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-24 13:14:07,755 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:07,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:07,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:07,756 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:07,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:07,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:07,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:14:07,896 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:07,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:14:07,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:14:07,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:14:07,897 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-24 13:14:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:08,030 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-24 13:14:08,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:14:08,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 13:14:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:08,034 INFO L225 Difference]: With dead ends: 85 [2018-01-24 13:14:08,034 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 13:14:08,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:14:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 13:14:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-24 13:14:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:14:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 13:14:08,043 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-24 13:14:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:08,043 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 13:14:08,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:14:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 13:14:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:14:08,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:08,045 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:08,045 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-24 13:14:08,045 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:08,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:08,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:08,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:08,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:08,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:08,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:14:08,134 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:14:08,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:08,148 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:14:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:08,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:14:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:08,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:14:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:08,293 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:14:08,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 13:14:08,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:08,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:14:08,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:14:08,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:14:08,294 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 13:14:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:08,375 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-24 13:14:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:14:08,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 13:14:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:08,377 INFO L225 Difference]: With dead ends: 115 [2018-01-24 13:14:08,377 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 13:14:08,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:14:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 13:14:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-24 13:14:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 13:14:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-24 13:14:08,389 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-24 13:14:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:08,389 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-24 13:14:08,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:14:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-24 13:14:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:14:08,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:08,390 INFO L322 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] [2018-01-24 13:14:08,391 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-24 13:14:08,391 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:08,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:08,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:08,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:08,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:08,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:08,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:14:08,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:14:08,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:08,631 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:14:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:08,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:14:08,707 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-01-24 13:14:08,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:08,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:08,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 13:14:08,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 13:14:08,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:08,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:14:08,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 13:14:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:08,847 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:14:09,478 WARN L143 SmtUtils]: Spent 265ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-24 13:14:09,776 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 15 treesize of output 19 [2018-01-24 13:14:09,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 13:14:09,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-24 13:14:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:09,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:14:09,827 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:14:09,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:09,830 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:14:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:09,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:14:09,874 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-01-24 13:14:09,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,881 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-01-24 13:14:09,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 13:14:09,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:14:09,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 13:14:09,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:14:09,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:14:09,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:14:09,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:09,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:14:09,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-24 13:14:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:10,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:14:10,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-24 13:14:10,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:10,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 13:14:10,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 13:14:10,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:14:10,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:10,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:14:10,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-24 13:14:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:14:10,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:14:10,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-24 13:14:10,187 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:14:10,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:14:10,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:14:10,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=478, Unknown=2, NotChecked=0, Total=600 [2018-01-24 13:14:10,188 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2018-01-24 13:14:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:10,512 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-24 13:14:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:14:10,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-24 13:14:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:10,514 INFO L225 Difference]: With dead ends: 130 [2018-01-24 13:14:10,514 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 13:14:10,515 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=595, Unknown=2, NotChecked=0, Total=756 [2018-01-24 13:14:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 13:14:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-01-24 13:14:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:14:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-24 13:14:10,525 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-01-24 13:14:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:10,525 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-24 13:14:10,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:14:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-24 13:14:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:14:10,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:10,526 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:10,526 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-01-24 13:14:10,527 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:10,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:10,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:10,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:10,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:14:10,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:14:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:14:10,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:14:10,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:14:10,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:14:10,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:14:10,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:14:10,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:14:10,571 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-01-24 13:14:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:14:10,624 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-24 13:14:10,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:14:10,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 13:14:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:14:10,626 INFO L225 Difference]: With dead ends: 77 [2018-01-24 13:14:10,626 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 13:14:10,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:14:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 13:14:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 13:14:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 13:14:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-24 13:14:10,636 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-01-24 13:14:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:14:10,636 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-24 13:14:10,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:14:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-24 13:14:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:14:10,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:14:10,637 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:14:10,637 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 13:14:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-01-24 13:14:10,638 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:14:10,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:10,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:14:10,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:14:10,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:14:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:14:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:14:10,691 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 13:14:10,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:14:10 BoogieIcfgContainer [2018-01-24 13:14:10,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:14:10,739 INFO L168 Benchmark]: Toolchain (without parser) took 4623.54 ms. Allocated memory was 303.6 MB in the beginning and 505.4 MB in the end (delta: 201.9 MB). Free memory was 263.5 MB in the beginning and 424.0 MB in the end (delta: -160.5 MB). Peak memory consumption was 41.3 MB. Max. memory is 5.3 GB. [2018-01-24 13:14:10,740 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:14:10,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.43 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:14:10,741 INFO L168 Benchmark]: Boogie Preprocessor took 34.53 ms. Allocated memory is still 303.6 MB. Free memory was 252.4 MB in the beginning and 250.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:14:10,741 INFO L168 Benchmark]: RCFGBuilder took 276.00 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 231.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:14:10,742 INFO L168 Benchmark]: TraceAbstraction took 4101.45 ms. Allocated memory was 303.6 MB in the beginning and 505.4 MB in the end (delta: 201.9 MB). Free memory was 231.3 MB in the beginning and 424.0 MB in the end (delta: -192.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:14:10,743 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.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.43 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.53 ms. Allocated memory is still 303.6 MB. Free memory was 252.4 MB in the beginning and 250.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 276.00 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 231.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4101.45 ms. Allocated memory was 303.6 MB in the beginning and 505.4 MB in the end (delta: 201.9 MB). Free memory was 231.3 MB in the beginning and 424.0 MB in the end (delta: -192.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] FCALL b[-2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. UNSAFE Result, 4.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 351 SDtfs, 560 SDslu, 509 SDs, 0 SdLazy, 492 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 136 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 302 ConstructedInterpolants, 28 QuantifiedInterpolants, 53453 SizeOfPredicates, 14 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 24/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-14-10-752.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-14-10-752.csv Received shutdown request...