java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:05:49,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:05:49,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:05:49,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:05:49,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:05:49,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:05:49,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:05:49,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:05:49,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:05:49,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:05:49,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:05:49,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:05:49,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:05:49,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:05:49,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:05:49,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:05:49,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:05:49,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:05:49,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:05:49,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:05:49,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:05:49,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:05:49,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:05:49,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:05:49,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:05:49,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:05:49,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:05:49,050 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:05:49,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:05:49,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:05:49,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:05:49,051 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:05:49,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:05:49,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:05:49,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:05:49,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:05:49,060 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:05:49,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:05:49,060 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:05:49,060 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:05:49,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:05:49,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:05:49,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:05:49,062 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:05:49,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:05:49,094 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:05:49,097 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:05:49,098 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:05:49,098 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:05:49,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-02-04 00:05:49,214 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:05:49,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:05:49,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:05:49,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:05:49,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:05:49,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa21b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49, skipping insertion in model container [2018-02-04 00:05:49,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,232 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:05:49,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:05:49,340 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:05:49,353 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:05:49,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49 WrapperNode [2018-02-04 00:05:49,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:05:49,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:05:49,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:05:49,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:05:49,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (1/1) ... [2018-02-04 00:05:49,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:05:49,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:05:49,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:05:49,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:05:49,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (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-04 00:05:49,421 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:05:49,421 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:05:49,421 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 00:05:49,421 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:05:49,421 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:05:49,421 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:05:49,422 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:05:49,596 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:05:49,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:49 BoogieIcfgContainer [2018-02-04 00:05:49,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:05:49,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:05:49,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:05:49,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:05:49,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:05:49" (1/3) ... [2018-02-04 00:05:49,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:49, skipping insertion in model container [2018-02-04 00:05:49,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:05:49" (2/3) ... [2018-02-04 00:05:49,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:05:49, skipping insertion in model container [2018-02-04 00:05:49,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:05:49" (3/3) ... [2018-02-04 00:05:49,604 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-02-04 00:05:49,611 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:05:49,615 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 00:05:49,647 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:05:49,647 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:05:49,647 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:05:49,647 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:05:49,648 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:05:49,648 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:05:49,648 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:05:49,648 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:05:49,649 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:05:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 00:05:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 00:05:49,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:49,666 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:49,666 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-02-04 00:05:49,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:49,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:49,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:49,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:49,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:49,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:49,769 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-04 00:05:49,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:49,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:05:49,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 00:05:49,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 00:05:49,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 00:05:49,783 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-02-04 00:05:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:49,797 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 00:05:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 00:05:49,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 00:05:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:49,803 INFO L225 Difference]: With dead ends: 56 [2018-02-04 00:05:49,804 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 00:05:49,805 INFO L554 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-02-04 00:05:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 00:05:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 00:05:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 00:05:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 00:05:49,873 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-02-04 00:05:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:49,873 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 00:05:49,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 00:05:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 00:05:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:05:49,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:49,874 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:49,874 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-02-04 00:05:49,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:49,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:49,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:49,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:49,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:49,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:49,937 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-04 00:05:49,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:49,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:05:49,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:05:49,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:05:49,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:05:49,938 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-02-04 00:05:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:50,015 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 00:05:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:05:50,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 00:05:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:50,017 INFO L225 Difference]: With dead ends: 52 [2018-02-04 00:05:50,017 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 00:05:50,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:05:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 00:05:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 00:05:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 00:05:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 00:05:50,022 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-02-04 00:05:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:50,023 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 00:05:50,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:05:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 00:05:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:05:50,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:50,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:50,024 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-02-04 00:05:50,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:50,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:50,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:50,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:50,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:05:50,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:05:50,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:05:50,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:05:50,094 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-02-04 00:05:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:50,172 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 00:05:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:05:50,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 00:05:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:50,175 INFO L225 Difference]: With dead ends: 51 [2018-02-04 00:05:50,175 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 00:05:50,176 INFO L554 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-02-04 00:05:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 00:05:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 00:05:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 00:05:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 00:05:50,180 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-02-04 00:05:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:50,180 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 00:05:50,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:05:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 00:05:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:05:50,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:50,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:50,181 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-02-04 00:05:50,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:50,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:50,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:50,263 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-04 00:05:50,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:50,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:05:50,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:05:50,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:05:50,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:05:50,264 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-02-04 00:05:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:50,316 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 00:05:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:05:50,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 00:05:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:50,317 INFO L225 Difference]: With dead ends: 48 [2018-02-04 00:05:50,317 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 00:05:50,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:05:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 00:05:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 00:05:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 00:05:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 00:05:50,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-02-04 00:05:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:50,321 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 00:05:50,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:05:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 00:05:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:05:50,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:50,322 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:50,322 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-02-04 00:05:50,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:50,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:50,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:50,440 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-04 00:05:50,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:50,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:05:50,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:05:50,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:05:50,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:05:50,441 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-02-04 00:05:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:50,538 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 00:05:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:05:50,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 00:05:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:50,541 INFO L225 Difference]: With dead ends: 58 [2018-02-04 00:05:50,541 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 00:05:50,541 INFO L554 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-02-04 00:05:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 00:05:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 00:05:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 00:05:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 00:05:50,545 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-02-04 00:05:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:50,546 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 00:05:50,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:05:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 00:05:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:05:50,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:50,546 INFO L351 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-02-04 00:05:50,547 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-02-04 00:05:50,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:50,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:50,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:50,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:05:50,608 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:05:50,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:05:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:50,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:05:50,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 00:05:50,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:05:50,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:05:50,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:05:50,726 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 9 states. [2018-02-04 00:05:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:50,836 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 00:05:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:05:50,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 00:05:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:50,838 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:05:50,838 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:05:50,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:05:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:05:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-02-04 00:05:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 00:05:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 00:05:50,846 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-02-04 00:05:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:50,846 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 00:05:50,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:05:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 00:05:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:05:50,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:50,847 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] [2018-02-04 00:05:50,847 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-02-04 00:05:50,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:50,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:50,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:50,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:50,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:51,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:05:51,010 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:05:51,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:51,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:05:51,064 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-04 00:05:51,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:51,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:51,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 00:05:51,108 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-02-04 00:05:51,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:51,116 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-02-04 00:05:51,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-04 00:05:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:51,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:05:51,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 00:05:51,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:05:51,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:05:51,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:05:51,237 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2018-02-04 00:05:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:51,564 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 00:05:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:05:51,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 00:05:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:51,565 INFO L225 Difference]: With dead ends: 105 [2018-02-04 00:05:51,565 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 00:05:51,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:05:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 00:05:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-04 00:05:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:05:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 00:05:51,570 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-02-04 00:05:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:51,573 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 00:05:51,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:05:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 00:05:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:05:51,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:51,573 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:51,574 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-02-04 00:05:51,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:51,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:51,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,575 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:51,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:51,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:05:51,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:51,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:05:51,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:05:51,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:05:51,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:05:51,612 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-02-04 00:05:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:51,641 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 00:05:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:05:51,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 00:05:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:51,643 INFO L225 Difference]: With dead ends: 75 [2018-02-04 00:05:51,643 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 00:05:51,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:05:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 00:05:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 00:05:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 00:05:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-02-04 00:05:51,647 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-02-04 00:05:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:51,647 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-02-04 00:05:51,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:05:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-02-04 00:05:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:05:51,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:51,648 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:51,648 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-02-04 00:05:51,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:51,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:51,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,649 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:51,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:51,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:05:51,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:05:51,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:05:51,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:05:51,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:05:51,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:05:51,743 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-02-04 00:05:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:51,821 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-02-04 00:05:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:05:51,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 00:05:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:51,821 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:05:51,821 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:05:51,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:05:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:05:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 00:05:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 00:05:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-02-04 00:05:51,826 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2018-02-04 00:05:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:51,826 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-02-04 00:05:51,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:05:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-02-04 00:05:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:05:51,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:51,827 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:51,827 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1546437503, now seen corresponding path program 2 times [2018-02-04 00:05:51,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:51,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:51,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:51,829 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:51,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:51,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:05:51,890 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:05:51,902 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:05:51,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:05:51,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:05:51,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:05:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:51,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:05:51,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-04 00:05:51,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:05:51,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:05:51,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:05:51,986 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2018-02-04 00:05:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:52,134 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-02-04 00:05:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:05:52,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 00:05:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:52,135 INFO L225 Difference]: With dead ends: 122 [2018-02-04 00:05:52,135 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 00:05:52,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:05:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 00:05:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-02-04 00:05:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 00:05:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-04 00:05:52,139 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 31 [2018-02-04 00:05:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:52,139 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-04 00:05:52,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:05:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-04 00:05:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:05:52,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:52,140 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:52,140 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash -979522942, now seen corresponding path program 1 times [2018-02-04 00:05:52,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:52,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:52,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:52,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:05:52,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:52,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:05:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:05:52,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:05:52,340 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:05:52,345 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:05:52,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:05:52,374 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-04 00:05:52,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:05:52,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:05:52,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:05:52,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:05:52,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 00:05:52,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 00:05:52,443 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 10 treesize of output 9 [2018-02-04 00:05:52,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 00:05:52,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 7 [2018-02-04 00:05:52,465 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 7 treesize of output 1 [2018-02-04 00:05:52,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-02-04 00:05:52,483 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 00:05:52,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 00:05:52,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:05:52,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,505 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-04 00:05:52,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2018-02-04 00:05:52,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-02-04 00:05:52,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 00:05:52,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-04 00:05:52,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:05:52,534 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-04 00:05:52,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-02-04 00:05:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 00:05:52,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:05:52,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-02-04 00:05:52,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:05:52,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:05:52,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2018-02-04 00:05:52,562 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 21 states. [2018-02-04 00:05:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:05:53,712 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-04 00:05:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 00:05:53,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-02-04 00:05:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:05:53,713 INFO L225 Difference]: With dead ends: 109 [2018-02-04 00:05:53,713 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 00:05:53,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1572, Unknown=2, NotChecked=84, Total=1980 [2018-02-04 00:05:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 00:05:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-02-04 00:05:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 00:05:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-02-04 00:05:53,718 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 32 [2018-02-04 00:05:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:05:53,718 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-02-04 00:05:53,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:05:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-02-04 00:05:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:05:53,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:05:53,719 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:05:53,720 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 00:05:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -979514998, now seen corresponding path program 1 times [2018-02-04 00:05:53,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:05:53,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:05:53,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:53,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:05:53,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:05:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:05:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:05:53,758 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 00:05:53,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:05:53 BoogieIcfgContainer [2018-02-04 00:05:53,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:05:53,791 INFO L168 Benchmark]: Toolchain (without parser) took 4576.66 ms. Allocated memory was 407.9 MB in the beginning and 694.7 MB in the end (delta: 286.8 MB). Free memory was 364.8 MB in the beginning and 533.5 MB in the end (delta: -168.8 MB). Peak memory consumption was 118.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:05:53,792 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:05:53,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.58 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 00:05:53,793 INFO L168 Benchmark]: Boogie Preprocessor took 27.84 ms. Allocated memory is still 407.9 MB. Free memory was 354.1 MB in the beginning and 352.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:05:53,793 INFO L168 Benchmark]: RCFGBuilder took 209.62 ms. Allocated memory is still 407.9 MB. Free memory was 352.8 MB in the beginning and 333.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:05:53,793 INFO L168 Benchmark]: TraceAbstraction took 4192.74 ms. Allocated memory was 407.9 MB in the beginning and 694.7 MB in the end (delta: 286.8 MB). Free memory was 333.4 MB in the beginning and 533.5 MB in the end (delta: -200.1 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:05:53,794 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.09 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.58 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.84 ms. Allocated memory is still 407.9 MB. Free memory was 354.1 MB in the beginning and 352.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.62 ms. Allocated memory is still 407.9 MB. Free memory was 352.8 MB in the beginning and 333.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4192.74 ms. Allocated memory was 407.9 MB in the beginning and 694.7 MB in the end (delta: 286.8 MB). Free memory was 333.4 MB in the beginning and 533.5 MB in the end (delta: -200.1 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible 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] = -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] [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[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] FCALL free(a) 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] [L643] FCALL free(b) 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.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 426 SDtfs, 976 SDslu, 1026 SDs, 0 SdLazy, 1207 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 105 SyntacticMatches, 8 SemanticMatches, 114 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 351 ConstructedInterpolants, 21 QuantifiedInterpolants, 56961 SizeOfPredicates, 19 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 29/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-05-53-800.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-05-53-800.csv Received shutdown request...