java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-pdr-smtinterpol.epf -i ../../../trunk/examples/programs/real-life/BigBranchingExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 09:26:19,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 09:26:19,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 09:26:19,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 09:26:19,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 09:26:19,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 09:26:19,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 09:26:19,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 09:26:19,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 09:26:19,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 09:26:19,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 09:26:19,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 09:26:19,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 09:26:19,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 09:26:19,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 09:26:19,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 09:26:19,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 09:26:19,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 09:26:19,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 09:26:19,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 09:26:19,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 09:26:19,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 09:26:19,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 09:26:19,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 09:26:19,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 09:26:19,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 09:26:19,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 09:26:19,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 09:26:19,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 09:26:19,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 09:26:19,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 09:26:19,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 09:26:19,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 09:26:19,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 09:26:19,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 09:26:19,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 09:26:19,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-pdr-smtinterpol.epf [2018-09-26 09:26:19,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 09:26:19,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 09:26:19,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 09:26:19,999 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 09:26:20,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 09:26:20,000 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=PDR [2018-09-26 09:26:20,000 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 09:26:20,000 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 09:26:20,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 09:26:20,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 09:26:20,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 09:26:20,078 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 09:26:20,078 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 09:26:20,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/BigBranchingExample.bpl [2018-09-26 09:26:20,080 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/BigBranchingExample.bpl' [2018-09-26 09:26:20,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 09:26:20,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 09:26:20,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 09:26:20,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 09:26:20,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 09:26:20,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,465 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 09:26:20,466 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 09:26:20,466 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 09:26:20,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 09:26:20,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 09:26:20,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 09:26:20,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 09:26:20,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 09:26:20,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 09:26:20,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 09:26:20,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 09:26:20,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/1) ... [2018-09-26 09:26:20,916 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.IllegalStateException$$la$init$ra$$1915 [2018-09-26 09:26:20,916 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.lang.Throwable$getMessage$16 [2018-09-26 09:26:20,918 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.lang.String$java.io.BufferedReader$readLine$1816 given in one single declaration [2018-09-26 09:26:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.io.BufferedReader$readLine$1816 [2018-09-26 09:26:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure java.lang.String$java.io.BufferedReader$readLine$1816 [2018-09-26 09:26:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.StringBuilder$$la$init$ra$$1826 [2018-09-26 09:26:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.PrintStream$println$217 [2018-09-26 09:26:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.InputStreamReader$$la$init$ra$$1918 [2018-09-26 09:26:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.IllegalArgumentException$$la$init$ra$$915 [2018-09-26 09:26:20,920 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.BufferedReader$$la$init$ra$$1809 [2018-09-26 09:26:20,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$java.lang.Integer$parseInt$932 given in one single declaration [2018-09-26 09:26:20,920 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.lang.Integer$parseInt$932 [2018-09-26 09:26:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure int$java.lang.Integer$parseInt$932 [2018-09-26 09:26:20,920 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.StringBuilder$java.lang.StringBuilder$append$1829 [2018-09-26 09:26:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.PrintStream$println$212 [2018-09-26 09:26:20,921 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$problem1.Problem1$calculateOutput$1806 given in one single declaration [2018-09-26 09:26:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure int$problem1.Problem1$calculateOutput$1806 [2018-09-26 09:26:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure int$problem1.Problem1$calculateOutput$1806 [2018-09-26 09:26:20,921 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$problem1.Problem1$$la$init$ra$$1805 given in one single declaration [2018-09-26 09:26:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure void$problem1.Problem1$$la$init$ra$$1805 [2018-09-26 09:26:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure void$problem1.Problem1$$la$init$ra$$1805 [2018-09-26 09:26:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.lang.StringBuilder$toString$1863 [2018-09-26 09:26:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2018-09-26 09:26:21,026 WARN L633 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-09-26 09:26:21,053 WARN L633 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-09-26 09:26:22,442 WARN L633 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-09-26 09:26:22,949 INFO L343 CfgBuilder]: Using library mode [2018-09-26 09:26:22,950 INFO L202 PluginConnector]: Adding new model BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:26:22 BoogieIcfgContainer [2018-09-26 09:26:22,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 09:26:22,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 09:26:22,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 09:26:22,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 09:26:22,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:20" (1/2) ... [2018-09-26 09:26:22,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fc42ad and model type BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:26:22, skipping insertion in model container [2018-09-26 09:26:22,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:26:22" (2/2) ... [2018-09-26 09:26:22,962 INFO L112 eAbstractionObserver]: Analyzing ICFG BigBranchingExample.bpl [2018-09-26 09:26:22,974 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:PDR Determinization: PREDICATE_ABSTRACTION [2018-09-26 09:26:22,986 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 126 error locations. [2018-09-26 09:26:23,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 09:26:23,045 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 09:26:23,045 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 09:26:23,046 INFO L383 AbstractCegarLoop]: Compute interpolants for PDR [2018-09-26 09:26:23,046 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 09:26:23,046 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 09:26:23,046 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 09:26:23,047 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 09:26:23,047 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 09:26:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states. [2018-09-26 09:26:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 09:26:23,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:26:23,145 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 09:26:23,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:26:23,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:26:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash 323433, now seen corresponding path program 1 times [2018-09-26 09:26:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:26:23,267 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:26:23,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 09:26:23,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 09:26:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 09:26:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:23,289 INFO L87 Difference]: Start difference. First operand 1570 states. Second operand 3 states. [2018-09-26 09:26:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 09:26:23,590 INFO L93 Difference]: Finished difference Result 3129 states and 5276 transitions. [2018-09-26 09:26:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 09:26:23,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 09:26:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 09:26:23,657 INFO L225 Difference]: With dead ends: 3129 [2018-09-26 09:26:23,658 INFO L226 Difference]: Without dead ends: 1561 [2018-09-26 09:26:23,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2018-09-26 09:26:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2018-09-26 09:26:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-09-26 09:26:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2574 transitions. [2018-09-26 09:26:23,886 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2574 transitions. Word has length 2 [2018-09-26 09:26:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 09:26:23,887 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2574 transitions. [2018-09-26 09:26:23,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 09:26:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2574 transitions. [2018-09-26 09:26:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 09:26:23,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:26:23,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 09:26:23,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:26:23,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:26:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 312704, now seen corresponding path program 1 times [2018-09-26 09:26:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:26:23,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:26:23,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 09:26:23,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 09:26:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 09:26:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:23,915 INFO L87 Difference]: Start difference. First operand 1561 states and 2574 transitions. Second operand 3 states. [2018-09-26 09:26:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 09:26:24,123 INFO L93 Difference]: Finished difference Result 1561 states and 2574 transitions. [2018-09-26 09:26:24,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 09:26:24,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 09:26:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 09:26:24,135 INFO L225 Difference]: With dead ends: 1561 [2018-09-26 09:26:24,136 INFO L226 Difference]: Without dead ends: 1560 [2018-09-26 09:26:24,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2018-09-26 09:26:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2018-09-26 09:26:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-09-26 09:26:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2573 transitions. [2018-09-26 09:26:24,323 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2573 transitions. Word has length 2 [2018-09-26 09:26:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 09:26:24,323 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 2573 transitions. [2018-09-26 09:26:24,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 09:26:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2573 transitions. [2018-09-26 09:26:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 09:26:24,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:26:24,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 09:26:24,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:26:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:26:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -127431756, now seen corresponding path program 1 times [2018-09-26 09:26:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:26:24,389 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:26:24,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 09:26:24,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 09:26:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 09:26:24,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:24,392 INFO L87 Difference]: Start difference. First operand 1560 states and 2573 transitions. Second operand 3 states. [2018-09-26 09:26:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 09:26:24,569 INFO L93 Difference]: Finished difference Result 1560 states and 2573 transitions. [2018-09-26 09:26:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 09:26:24,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-09-26 09:26:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 09:26:24,580 INFO L225 Difference]: With dead ends: 1560 [2018-09-26 09:26:24,581 INFO L226 Difference]: Without dead ends: 1559 [2018-09-26 09:26:24,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 09:26:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2018-09-26 09:26:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2018-09-26 09:26:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2018-09-26 09:26:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2572 transitions. [2018-09-26 09:26:24,774 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2572 transitions. Word has length 129 [2018-09-26 09:26:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 09:26:24,775 INFO L480 AbstractCegarLoop]: Abstraction has 1559 states and 2572 transitions. [2018-09-26 09:26:24,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 09:26:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2572 transitions. [2018-09-26 09:26:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 09:26:24,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:26:24,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 09:26:24,793 INFO L423 AbstractCegarLoop]: === Iteration 4 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:26:24,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:26:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash 344588326, now seen corresponding path program 1 times [2018-09-26 09:26:24,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:26:26,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:26:26,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-26 09:26:26,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 09:26:26,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 09:26:26,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-09-26 09:26:26,089 INFO L87 Difference]: Start difference. First operand 1559 states and 2572 transitions. Second operand 16 states. [2018-09-26 09:27:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 09:27:07,848 INFO L93 Difference]: Finished difference Result 82488 states and 124041 transitions. [2018-09-26 09:27:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 09:27:07,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2018-09-26 09:27:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 09:27:08,184 INFO L225 Difference]: With dead ends: 82488 [2018-09-26 09:27:08,184 INFO L226 Difference]: Without dead ends: 82484 [2018-09-26 09:27:08,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 991 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6593 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2270, Invalid=14242, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 09:27:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82484 states. [2018-09-26 09:27:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82484 to 2446. [2018-09-26 09:27:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2018-09-26 09:27:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4167 transitions. [2018-09-26 09:27:11,748 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4167 transitions. Word has length 130 [2018-09-26 09:27:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 09:27:11,749 INFO L480 AbstractCegarLoop]: Abstraction has 2446 states and 4167 transitions. [2018-09-26 09:27:11,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 09:27:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4167 transitions. [2018-09-26 09:27:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 09:27:11,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:27:11,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 09:27:11,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:27:11,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:27:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash 292126886, now seen corresponding path program 1 times [2018-09-26 09:27:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:27:12,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:27:12,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-26 09:27:12,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 09:27:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 09:27:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-09-26 09:27:12,526 INFO L87 Difference]: Start difference. First operand 2446 states and 4167 transitions. Second operand 17 states. [2018-09-26 09:29:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 09:29:49,928 INFO L93 Difference]: Finished difference Result 89887 states and 135408 transitions. [2018-09-26 09:29:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 09:29:49,929 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2018-09-26 09:29:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 09:29:50,153 INFO L225 Difference]: With dead ends: 89887 [2018-09-26 09:29:50,153 INFO L226 Difference]: Without dead ends: 89883 [2018-09-26 09:29:50,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1166 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8009 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3298, Invalid=16162, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 09:29:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89883 states. [2018-09-26 09:29:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89883 to 2670. [2018-09-26 09:29:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-26 09:29:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4571 transitions. [2018-09-26 09:29:55,255 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4571 transitions. Word has length 131 [2018-09-26 09:29:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 09:29:55,256 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 4571 transitions. [2018-09-26 09:29:55,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 09:29:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4571 transitions. [2018-09-26 09:29:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 09:29:55,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 09:29:55,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 09:29:55,263 INFO L423 AbstractCegarLoop]: === Iteration 6 === [int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 09:29:55,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 09:29:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 677528204, now seen corresponding path program 1 times [2018-09-26 09:29:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 09:29:55,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 09:29:55,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-26 09:29:55,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 09:29:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 09:29:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-09-26 09:29:55,899 INFO L87 Difference]: Start difference. First operand 2670 states and 4571 transitions. Second operand 16 states. Received shutdown request... [2018-09-26 09:30:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 09:30:31,472 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 09:30:31,480 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 09:30:31,480 INFO L202 PluginConnector]: Adding new model BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:30:31 BoogieIcfgContainer [2018-09-26 09:30:31,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 09:30:31,482 INFO L168 Benchmark]: Toolchain (without parser) took 251136.09 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -864.7 MB). Peak memory consumption was 982.3 MB. Max. memory is 7.1 GB. [2018-09-26 09:30:31,484 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 09:30:31,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 300.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 09:30:31,485 INFO L168 Benchmark]: Boogie Preprocessor took 180.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 09:30:31,486 INFO L168 Benchmark]: RCFGBuilder took 2120.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 233.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 7.1 GB. [2018-09-26 09:30:31,487 INFO L168 Benchmark]: TraceAbstraction took 248528.64 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.9 MB. Max. memory is 7.1 GB. [2018-09-26 09:30:31,492 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 300.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 180.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2120.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 233.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248528.64 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13535]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13535). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20732]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20732). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14187]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14187). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16527]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16527). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18607]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18607). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19255]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19255). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15782]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15782). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18217]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18217). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16657]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16657). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20345]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20345). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16137]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16137). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20035]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20035). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19940]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19940). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14445]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14445). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16950]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16950). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18345]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18345). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13667]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13667). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19515]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19515). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17175]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17175). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14352]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14352). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15487]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15487). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17177]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17177). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18865]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18865). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19032]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19032). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13537]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13537). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20297]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20297). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20709]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20709). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16432]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16432). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19517]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19517). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16822]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16822). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15095]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15095). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15652]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15652). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20711]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20711). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14185]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14185). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14742]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14742). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16040]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16040). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18772]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18772). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19420]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19420). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14350]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14350). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17080]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17080). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16952]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16952). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17565]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17565). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1351]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1351). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15097]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15097). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17697]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17697). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16302]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16302). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19127]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19127). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20734]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20734). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13962]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13962). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19030]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19030). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17567]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17567). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17825]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17825). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14870]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14870). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16820]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16820). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18215]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18215). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14872]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14872). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16525]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16525). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13407]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13407). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20540]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20540). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14965]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14965). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20671]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20671). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18605]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18605). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18087]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20037]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20037). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17437]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17437). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18867]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18867). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14090]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14090). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20295]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20295). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14575]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14575). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17990]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17990). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20597]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20597). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15912]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15912). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13960]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13960). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14740]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14740). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20424]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20424). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13405]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13405). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19257]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19257). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16430]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16430). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17695]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17695). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19775]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19775). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20422]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20422). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14577]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14577). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15910]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15910). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18085]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18477]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18477). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18347]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18347). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20669]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20669). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19125]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19125). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15780]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15780). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14092]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14092). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18475]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18475). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16135]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16135). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15357]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15357). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17435]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17435). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13665]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13665). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17992]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17992). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20200]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20200). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17082]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17082). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17827]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17827). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15225]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15225). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16655]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16655). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20538]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20538). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13830]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13830). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16042]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16042). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17340]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17340). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15227]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15227). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14447]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14447). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15650]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15650). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15485]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15485). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20202]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20202). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19647]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19647). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17342]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17342). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19942]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19942). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13275]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13275). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19422]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19422). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 20347]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20347). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14967]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14967). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16300]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16300). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18770]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18770). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15355]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15355). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19777]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19777). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 234]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 234). Cancelled while BasicCegarLoop was constructing difference of abstraction (2670states) and FLOYD_HOARE automaton (currently 79 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (14264 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 2581 locations, 126 error locations. TIMEOUT Result, 248.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 236.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28657 SDtfs, 438029 SDslu, 293348 SDs, 0 SdLazy, 140482 SolverSat, 4742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3707 GetRequests, 3341 SyntacticMatches, 6 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17482 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2670occurred in iteration=5, 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: 9.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 167251 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.5s PdrRuntime, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BigBranchingExample.bpl_AutomizerBpl-pdr-smtinterpol.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_09-30-31-522.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BigBranchingExample.bpl_AutomizerBpl-pdr-smtinterpol.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_09-30-31-522.csv Completed graceful shutdown