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/memsafety/960521-1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:34:18,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:34:18,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:34:18,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:34:18,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:34:18,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:34:18,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:34:18,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:34:18,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:34:18,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:34:18,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:34:18,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:34:18,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:34:18,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:34:18,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:34:18,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:34:18,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:34:18,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:34:18,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:34:18,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:34:18,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:34:18,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:34:18,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:34:18,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:34:18,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:34:18,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:34:18,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:34:18,901 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:34:18,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:34:18,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:34:18,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:34:18,902 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 12:34:18,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:34:18,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:34:18,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:34:18,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:34:18,913 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:34:18,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:34:18,914 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:34:18,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:34:18,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:34:18,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:34:18,916 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:34:18,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:34:18,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:34:18,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:34:18,953 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:34:18,956 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:34:18,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:34:18,957 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:34:18,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_true-valid-memsafety.i [2018-02-04 12:34:19,096 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:34:19,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:34:19,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:34:19,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:34:19,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:34:19,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32677a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19, skipping insertion in model container [2018-02-04 12:34:19,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,120 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:34:19,145 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:34:19,232 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:34:19,244 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:34:19,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19 WrapperNode [2018-02-04 12:34:19,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:34:19,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:34:19,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:34:19,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:34:19,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (1/1) ... [2018-02-04 12:34:19,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:34:19,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:34:19,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:34:19,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:34:19,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (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 12:34:19,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:34:19,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:34:19,312 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 12:34:19,312 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:34:19,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:34:19,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:34:19,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:34:19,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:34:19,464 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:34:19,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:34:19 BoogieIcfgContainer [2018-02-04 12:34:19,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:34:19,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:34:19,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:34:19,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:34:19,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:34:19" (1/3) ... [2018-02-04 12:34:19,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:34:19, skipping insertion in model container [2018-02-04 12:34:19,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:34:19" (2/3) ... [2018-02-04 12:34:19,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12696471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:34:19, skipping insertion in model container [2018-02-04 12:34:19,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:34:19" (3/3) ... [2018-02-04 12:34:19,470 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i [2018-02-04 12:34:19,475 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:34:19,480 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 12:34:19,505 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:34:19,506 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:34:19,506 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:34:19,506 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:34:19,506 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:34:19,506 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:34:19,506 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:34:19,506 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:34:19,507 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:34:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 12:34:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:34:19,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:19,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:19,528 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 12:34:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 12:34:19,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:19,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:19,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:19,565 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:19,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:19,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:19,680 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 12:34:19,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:34:19,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:34:19,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:34:19,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:34:19,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:34:19,692 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 12:34:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:19,826 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 12:34:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:34:19,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 12:34:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:19,833 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:34:19,833 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:34:19,834 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 12:34:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:34:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:34:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:34:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 12:34:19,854 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 12:34:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:19,855 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 12:34:19,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:34:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 12:34:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:34:19,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:19,855 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:19,855 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 12:34:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 12:34:19,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:19,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:19,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:19,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:19,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:19,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:19,938 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 12:34:19,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:34:19,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:34:19,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:34:19,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:34:19,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:34:19,940 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 12:34:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:20,001 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 12:34:20,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:34:20,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 12:34:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:20,003 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:34:20,003 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:34:20,004 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 12:34:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:34:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:34:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:34:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 12:34:20,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 12:34:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:20,008 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 12:34:20,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:34:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 12:34:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:34:20,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:20,009 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:20,009 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 12:34:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 12:34:20,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:20,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:20,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:20,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:20,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:20,072 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 12:34:20,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:34:20,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:34:20,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:34:20,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:34:20,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:34:20,074 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-04 12:34:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:20,114 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 12:34:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:34:20,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 12:34:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:20,115 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:34:20,115 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:34:20,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:34:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:34:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 12:34:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 12:34:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 12:34:20,118 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 12:34:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:20,118 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 12:34:20,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:34:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 12:34:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:34:20,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:20,118 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:20,118 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 12:34:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 12:34:20,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:20,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:20,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:20,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:20,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:20,233 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 12:34:20,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:34:20,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:34:20,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:34:20,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:34:20,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:34:20,235 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 12:34:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:20,314 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 12:34:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:34:20,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 12:34:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:20,315 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:34:20,315 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:34:20,316 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 12:34:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:34:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 12:34:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:34:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 12:34:20,320 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 12:34:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:20,320 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 12:34:20,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:34:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 12:34:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:34:20,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:20,321 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:20,321 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 12:34:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 12:34:20,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:20,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:20,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:20,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:20,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:20,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:20,444 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 12:34:20,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:20,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:20,496 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 12:34:20,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:20,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:20,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 12:34:20,511 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 12:34:20,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:20,519 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 12:34:20,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-04 12:34:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:20,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:20,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-02-04 12:34:20,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:34:20,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:34:20,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:34:20,631 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-02-04 12:34:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:20,830 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 12:34:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:34:20,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-02-04 12:34:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:20,831 INFO L225 Difference]: With dead ends: 63 [2018-02-04 12:34:20,831 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 12:34:20,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:34:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 12:34:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-02-04 12:34:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:34:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 12:34:20,835 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-02-04 12:34:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:20,835 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 12:34:20,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:34:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 12:34:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:34:20,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:20,836 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:20,836 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 12:34:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 12:34:20,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:20,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:20,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:20,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:20,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:20,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:20,997 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 12:34:21,005 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:34:21,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:34:21,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:21,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:21,033 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 12:34:21,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,040 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 12:34:21,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 12:34:21,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:21,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:21,083 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 12:34:21,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,088 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-02-04 12:34:21,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:34:21,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-02-04 12:34:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:21,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:21,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 12:34:21,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:34:21,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:34:21,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:34:21,251 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-02-04 12:34:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:21,631 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 12:34:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:34:21,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-04 12:34:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:21,632 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:34:21,632 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:34:21,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:34:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:34:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 12:34:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:34:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 12:34:21,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-02-04 12:34:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:21,635 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 12:34:21,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:34:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 12:34:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:34:21,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:21,636 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:21,636 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 12:34:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 12:34:21,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:21,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:21,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:21,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:21,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:21,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:21,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:21,775 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 12:34:21,779 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:34:21,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 12:34:21,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:21,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:21,815 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 12:34:21,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,818 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 12:34:21,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 12:34:21,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:21,856 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-02-04 12:34:21,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:21,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:21,865 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 12:34:21,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:21,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 12:34:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 12:34:22,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:22,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-04 12:34:22,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:34:22,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:34:22,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:34:22,054 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-02-04 12:34:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:22,527 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 12:34:22,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:34:22,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-04 12:34:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:22,530 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:34:22,530 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 12:34:22,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:34:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 12:34:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-02-04 12:34:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:34:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 12:34:22,533 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-02-04 12:34:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:22,533 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 12:34:22,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:34:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 12:34:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:34:22,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:22,534 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:22,534 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 12:34:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-02-04 12:34:22,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:22,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:22,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:22,535 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:22,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:22,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:22,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:22,597 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 12:34:22,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:22,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:22,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:22,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 12:34:22,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:34:22,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:34:22,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:34:22,707 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-04 12:34:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:22,791 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-04 12:34:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:34:22,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-04 12:34:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:22,793 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:34:22,793 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 12:34:22,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:34:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 12:34:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-02-04 12:34:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:34:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-02-04 12:34:22,798 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-02-04 12:34:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:22,798 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-02-04 12:34:22,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:34:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-02-04 12:34:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:34:22,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:22,800 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:22,800 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 12:34:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-02-04 12:34:22,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:22,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:22,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:22,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:22,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:22,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:34:22,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:22,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:22,901 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:34:22,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:34:22,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:22,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:22,940 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 12:34:22,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:22,944 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 12:34:22,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 12:34:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:34:23,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:34:23,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-02-04 12:34:23,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:34:23,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:34:23,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:34:23,073 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2018-02-04 12:34:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:23,598 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-04 12:34:23,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:34:23,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 12:34:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:23,603 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:34:23,603 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:34:23,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:34:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:34:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-02-04 12:34:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:34:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-04 12:34:23,608 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 44 [2018-02-04 12:34:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:23,608 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-04 12:34:23,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:34:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-04 12:34:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:34:23,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:23,609 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:23,609 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 12:34:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1590645252, now seen corresponding path program 1 times [2018-02-04 12:34:23,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:23,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:23,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:23,611 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:23,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:23,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 12:34:23,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:34:23,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:34:23,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:34:23,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:34:23,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:34:23,702 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 4 states. [2018-02-04 12:34:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:23,720 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-02-04 12:34:23,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:34:23,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-04 12:34:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:23,721 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:34:23,721 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:34:23,721 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 12:34:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:34:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 12:34:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:34:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 12:34:23,725 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-02-04 12:34:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:23,725 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 12:34:23,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:34:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 12:34:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 12:34:23,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:23,727 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 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 12:34:23,727 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 12:34:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 221692532, now seen corresponding path program 1 times [2018-02-04 12:34:23,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:23,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:23,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:23,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:23,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:23,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:34:23,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:23,813 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:23,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:23,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:34:23,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:23,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 12:34:23,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:34:23,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:34:23,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:34:23,919 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 20 states. [2018-02-04 12:34:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:24,014 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-02-04 12:34:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:34:24,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-02-04 12:34:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:24,015 INFO L225 Difference]: With dead ends: 101 [2018-02-04 12:34:24,015 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:34:24,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:34:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:34:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-04 12:34:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 12:34:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-02-04 12:34:24,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 77 [2018-02-04 12:34:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:24,019 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-02-04 12:34:24,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:34:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-02-04 12:34:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 12:34:24,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:24,020 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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 12:34:24,020 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 12:34:24,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762915, now seen corresponding path program 2 times [2018-02-04 12:34:24,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:24,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:24,020 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:24,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:24,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:24,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 12:34:24,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:24,118 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:24,123 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:34:24,142 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:34:24,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:24,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:24,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:34:24,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:24,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:24,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-04 12:34:24,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:24,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:24,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 12:34:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:24,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:24,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-02-04 12:34:24,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:24,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:34:24,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:24,273 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 12:34:24,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 12:34:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-02-04 12:34:24,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:34:24,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2018-02-04 12:34:24,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:34:24,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:34:24,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:34:24,327 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 19 states. [2018-02-04 12:34:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:24,799 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 12:34:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 12:34:24,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-04 12:34:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:24,800 INFO L225 Difference]: With dead ends: 107 [2018-02-04 12:34:24,800 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 12:34:24,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:34:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 12:34:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-02-04 12:34:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 12:34:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-04 12:34:24,804 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-02-04 12:34:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:24,804 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-04 12:34:24,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:34:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-04 12:34:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 12:34:24,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:24,806 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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 12:34:24,806 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:34:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1885333684, now seen corresponding path program 1 times [2018-02-04 12:34:24,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:24,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:24,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:24,807 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:24,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:24,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 12:34:24,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:24,980 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:24,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:25,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 12:34:25,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:25,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-04 12:34:25,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:34:25,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:34:25,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:34:25,106 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 24 states. [2018-02-04 12:34:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:25,195 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-02-04 12:34:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:34:25,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2018-02-04 12:34:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:25,196 INFO L225 Difference]: With dead ends: 115 [2018-02-04 12:34:25,196 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 12:34:25,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:34:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 12:34:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-02-04 12:34:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 12:34:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 12:34:25,198 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-02-04 12:34:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:25,199 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 12:34:25,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:34:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 12:34:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 12:34:25,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:25,200 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 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 12:34:25,200 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:34:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -984574572, now seen corresponding path program 2 times [2018-02-04 12:34:25,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:25,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:25,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:25,201 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:34:25,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:25,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:34:25,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:25,328 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:25,333 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:34:25,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:34:25,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:25,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:34:25,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:25,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-02-04 12:34:25,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:34:25,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:34:25,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:34:25,469 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 26 states. [2018-02-04 12:34:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:25,591 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-02-04 12:34:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:34:25,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-02-04 12:34:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:25,592 INFO L225 Difference]: With dead ends: 123 [2018-02-04 12:34:25,592 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 12:34:25,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=260, Invalid=442, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:34:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 12:34:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-04 12:34:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 12:34:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-02-04 12:34:25,595 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-02-04 12:34:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:25,595 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-02-04 12:34:25,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:34:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-02-04 12:34:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 12:34:25,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:25,596 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 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 12:34:25,596 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:34:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1299772556, now seen corresponding path program 3 times [2018-02-04 12:34:25,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:25,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:25,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:25,597 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:25,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:25,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 12:34:25,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:25,770 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:25,778 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:34:25,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-04 12:34:25,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:25,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:34:26,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:34:26,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-02-04 12:34:26,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 12:34:26,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 12:34:26,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=666, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:34:26,094 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 32 states. [2018-02-04 12:34:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:26,252 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-02-04 12:34:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:34:26,252 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-02-04 12:34:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:26,253 INFO L225 Difference]: With dead ends: 137 [2018-02-04 12:34:26,253 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 12:34:26,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=356, Invalid=700, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:34:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 12:34:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-02-04 12:34:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 12:34:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-02-04 12:34:26,255 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 113 [2018-02-04 12:34:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:26,256 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-02-04 12:34:26,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 12:34:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-02-04 12:34:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 12:34:26,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:26,257 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 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 12:34:26,257 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:34:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -310498389, now seen corresponding path program 4 times [2018-02-04 12:34:26,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:26,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:26,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:26,259 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:26,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:34:26,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:34:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 12:34:26,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:34:26,397 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:34:26,402 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:34:26,427 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:34:26,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:26,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:26,431 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 12:34:26,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:34:26,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:26,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:26,447 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 12:34:26,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 12:34:26,466 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 12:34:26,467 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 12:34:26,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 12:34:26,481 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 12:34:26,482 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 12:34:26,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:34:26,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-02-04 12:34:26,499 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 12:34:26,542 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-04 12:34:26,547 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_4 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-04 12:34:26,617 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 12:34:26,959 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 12:34:26,990 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1))) |c_#memory_int|))) is different from true [2018-02-04 12:34:27,008 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 12:34:27,027 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_12 Int) (v_prenex_3 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 v_prenex_12) c_~a.offset) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 12:34:27,063 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= c_~a.base c_~b.base)) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (foo_~i~0 Int) (v_prenex_2 Int) (v_prenex_3 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| c_~a.base (store (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| c_~a.base) (+ (* 4 v_prenex_2) c_~a.offset) (- 1)) (+ (* 4 v_prenex_3) c_~a.offset) (- 1)) (+ (* 4 v_prenex_4) c_~a.offset) (- 1)) (+ (* 4 v_prenex_5) c_~a.offset) (- 1)) (+ (* 4 v_prenex_6) c_~a.offset) (- 1)) (+ (* 4 v_prenex_7) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_8)) (- 1)) (+ c_~a.offset (* 4 v_prenex_9)) (- 1)) (+ c_~a.offset (* 4 v_prenex_10)) (- 1)) (+ (* 4 v_prenex_11) c_~a.offset) (- 1)) (+ (* 4 v_prenex_12) c_~a.offset) (- 1)) (+ c_~a.offset (* 4 v_prenex_13)) (- 1)) (+ (* 4 foo_~i~0) c_~a.offset) (- 1)))))) is different from true [2018-02-04 12:35:01,051 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 89 [2018-02-04 12:35:06,985 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 92 [2018-02-04 12:35:17,717 WARN L143 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 95 [2018-02-04 12:35:27,301 WARN L143 SmtUtils]: Spent 2097ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 12:36:59,854 WARN L143 SmtUtils]: Spent 352ms on a formula simplification that was a NOOP. DAG size: 101 [2018-02-04 12:37:09,996 WARN L143 SmtUtils]: Spent 1829ms on a formula simplification that was a NOOP. DAG size: 104 [2018-02-04 12:37:19,230 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 107 [2018-02-04 12:37:40,449 WARN L143 SmtUtils]: Spent 1020ms on a formula simplification that was a NOOP. DAG size: 110 [2018-02-04 12:37:52,194 WARN L143 SmtUtils]: Spent 464ms on a formula simplification that was a NOOP. DAG size: 113 Received shutdown request... [2018-02-04 12:38:05,523 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 12:38:05,523 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:38:05,528 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:38:05,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:38:05 BoogieIcfgContainer [2018-02-04 12:38:05,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:38:05,529 INFO L168 Benchmark]: Toolchain (without parser) took 226432.27 ms. Allocated memory was 389.0 MB in the beginning and 733.5 MB in the end (delta: 344.5 MB). Free memory was 345.7 MB in the beginning and 695.2 MB in the end (delta: -349.5 MB). Peak memory consumption was 328.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:38:05,530 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 389.0 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:38:05,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.82 ms. Allocated memory is still 389.0 MB. Free memory was 345.7 MB in the beginning and 335.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:38:05,531 INFO L168 Benchmark]: Boogie Preprocessor took 21.58 ms. Allocated memory is still 389.0 MB. Free memory was 335.1 MB in the beginning and 333.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:38:05,531 INFO L168 Benchmark]: RCFGBuilder took 194.14 ms. Allocated memory is still 389.0 MB. Free memory was 333.7 MB in the beginning and 313.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:38:05,531 INFO L168 Benchmark]: TraceAbstraction took 226062.78 ms. Allocated memory was 389.0 MB in the beginning and 733.5 MB in the end (delta: 344.5 MB). Free memory was 313.9 MB in the beginning and 695.2 MB in the end (delta: -381.3 MB). Peak memory consumption was 296.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:38:05,532 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.17 ms. Allocated memory is still 389.0 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.82 ms. Allocated memory is still 389.0 MB. Free memory was 345.7 MB in the beginning and 335.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.58 ms. Allocated memory is still 389.0 MB. Free memory was 335.1 MB in the beginning and 333.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 194.14 ms. Allocated memory is still 389.0 MB. Free memory was 333.7 MB in the beginning and 313.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 226062.78 ms. Allocated memory was 389.0 MB in the beginning and 733.5 MB in the end (delta: 344.5 MB). Free memory was 313.9 MB in the beginning and 695.2 MB in the end (delta: -381.3 MB). Peak memory consumption was 296.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 126 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 226.0s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 443 SDtfs, 2265 SDslu, 2336 SDs, 0 SdLazy, 2394 SolverSat, 555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 850 GetRequests, 569 SyntacticMatches, 10 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1795 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1384 NumberOfCodeBlocks, 1288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1359 ConstructedInterpolants, 83 QuantifiedInterpolants, 467028 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2030 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 1924/3678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-38-05-539.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-38-05-539.csv Completed graceful shutdown