java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-pdr.epf -i ../../../trunk/examples/programs/real-life/BigBranchingExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 09:00:54,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 09:00:54,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 09:00:54,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 09:00:54,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 09:00:54,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 09:00:54,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 09:00:54,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 09:00:54,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 09:00:54,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 09:00:54,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 09:00:54,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 09:00:54,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 09:00:54,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 09:00:54,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 09:00:54,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 09:00:54,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 09:00:54,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 09:00:54,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 09:00:54,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 09:00:54,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 09:00:54,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 09:00:55,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 09:00:55,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 09:00:55,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 09:00:55,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 09:00:55,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 09:00:55,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 09:00:55,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 09:00:55,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 09:00:55,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 09:00:55,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 09:00:55,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 09:00:55,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 09:00:55,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 09:00:55,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 09:00:55,011 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-pdr.epf [2018-07-25 09:00:55,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 09:00:55,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 09:00:55,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 09:00:55,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=PDR [2018-07-25 09:00:55,024 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 09:00:55,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 09:00:55,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 09:00:55,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 09:00:55,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 09:00:55,103 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 09:00:55,104 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 09:00:55,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/BigBranchingExample.bpl [2018-07-25 09:00:55,105 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/BigBranchingExample.bpl' [2018-07-25 09:00:55,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 09:00:55,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 09:00:55,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 09:00:55,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 09:00:55,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 09:00:55,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,427 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 09:00:55,427 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 09:00:55,427 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 09:00:55,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 09:00:55,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 09:00:55,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 09:00:55,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 09:00:55,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... [2018-07-25 09:00:55,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 09:00:55,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 09:00:55,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 09:00:55,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 09:00:55,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-07-25 09:00:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.IllegalStateException$$la$init$ra$$1915 [2018-07-25 09:00:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.lang.Throwable$getMessage$16 [2018-07-25 09:00:55,838 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.lang.String$java.io.BufferedReader$readLine$1816 given in one single declaration [2018-07-25 09:00:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.io.BufferedReader$readLine$1816 [2018-07-25 09:00:55,838 INFO L138 BoogieDeclarations]: Found implementation of procedure java.lang.String$java.io.BufferedReader$readLine$1816 [2018-07-25 09:00:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.StringBuilder$$la$init$ra$$1826 [2018-07-25 09:00:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.PrintStream$println$217 [2018-07-25 09:00:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.InputStreamReader$$la$init$ra$$1918 [2018-07-25 09:00:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.IllegalArgumentException$$la$init$ra$$915 [2018-07-25 09:00:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.BufferedReader$$la$init$ra$$1809 [2018-07-25 09:00:55,840 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$java.lang.Integer$parseInt$932 given in one single declaration [2018-07-25 09:00:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.lang.Integer$parseInt$932 [2018-07-25 09:00:55,840 INFO L138 BoogieDeclarations]: Found implementation of procedure int$java.lang.Integer$parseInt$932 [2018-07-25 09:00:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.StringBuilder$java.lang.StringBuilder$append$1829 [2018-07-25 09:00:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.io.PrintStream$println$212 [2018-07-25 09:00:55,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$problem1.Problem1$calculateOutput$1806 given in one single declaration [2018-07-25 09:00:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure int$problem1.Problem1$calculateOutput$1806 [2018-07-25 09:00:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure int$problem1.Problem1$calculateOutput$1806 [2018-07-25 09:00:55,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$problem1.Problem1$$la$init$ra$$1805 given in one single declaration [2018-07-25 09:00:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure void$problem1.Problem1$$la$init$ra$$1805 [2018-07-25 09:00:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure void$problem1.Problem1$$la$init$ra$$1805 [2018-07-25 09:00:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure java.lang.String$java.lang.StringBuilder$toString$1863 [2018-07-25 09:00:55,844 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2018-07-25 09:00:56,512 WARN L459 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-07-25 09:00:56,601 WARN L459 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-07-25 09:01:03,427 WARN L459 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-07-25 09:01:08,735 INFO L270 CfgBuilder]: Using library mode [2018-07-25 09:01:08,736 INFO L202 PluginConnector]: Adding new model BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 09:01:08 BoogieIcfgContainer [2018-07-25 09:01:08,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 09:01:08,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 09:01:08,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 09:01:08,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 09:01:08,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 09:00:55" (1/2) ... [2018-07-25 09:01:08,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b399725 and model type BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 09:01:08, skipping insertion in model container [2018-07-25 09:01:08,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 09:01:08" (2/2) ... [2018-07-25 09:01:08,745 INFO L112 eAbstractionObserver]: Analyzing ICFG BigBranchingExample.bpl [2018-07-25 09:01:08,754 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:PDR Determinization: PREDICATE_ABSTRACTION [2018-07-25 09:01:08,765 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 126 error locations. [2018-07-25 09:01:08,808 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 09:01:08,809 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 09:01:08,809 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 09:01:08,810 INFO L376 AbstractCegarLoop]: Compute interpolants for PDR [2018-07-25 09:01:08,810 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 09:01:08,810 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 09:01:08,810 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 09:01:08,811 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 09:01:08,811 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 09:01:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states. [2018-07-25 09:01:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 09:01:08,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 09:01:08,880 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 09:01:08,885 INFO L415 AbstractCegarLoop]: === Iteration 1 === [int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-07-25 09:01:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash 323433, now seen corresponding path program 1 times [2018-07-25 09:01:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 09:01:08,978 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 09:01:08,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 09:01:08,984 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 09:01:08,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 09:01:08,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 09:01:08,994 INFO L87 Difference]: Start difference. First operand 1570 states. Second operand 3 states. [2018-07-25 09:01:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 09:01:09,264 INFO L93 Difference]: Finished difference Result 3129 states and 5276 transitions. [2018-07-25 09:01:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 09:01:09,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 09:01:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 09:01:09,317 INFO L225 Difference]: With dead ends: 3129 [2018-07-25 09:01:09,317 INFO L226 Difference]: Without dead ends: 1561 [2018-07-25 09:01:09,332 INFO L574 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-07-25 09:01:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2018-07-25 09:01:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2018-07-25 09:01:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-07-25 09:01:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2574 transitions. [2018-07-25 09:01:09,535 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2574 transitions. Word has length 2 [2018-07-25 09:01:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 09:01:09,535 INFO L472 AbstractCegarLoop]: Abstraction has 1561 states and 2574 transitions. [2018-07-25 09:01:09,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 09:01:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2574 transitions. [2018-07-25 09:01:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 09:01:09,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 09:01:09,536 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 09:01:09,540 INFO L415 AbstractCegarLoop]: === Iteration 2 === [int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-07-25 09:01:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash 312704, now seen corresponding path program 1 times [2018-07-25 09:01:09,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 09:01:09,576 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 09:01:09,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 09:01:09,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 09:01:09,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 09:01:09,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 09:01:09,579 INFO L87 Difference]: Start difference. First operand 1561 states and 2574 transitions. Second operand 3 states. [2018-07-25 09:01:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 09:01:09,730 INFO L93 Difference]: Finished difference Result 1561 states and 2574 transitions. [2018-07-25 09:01:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 09:01:09,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 09:01:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 09:01:09,741 INFO L225 Difference]: With dead ends: 1561 [2018-07-25 09:01:09,741 INFO L226 Difference]: Without dead ends: 1560 [2018-07-25 09:01:09,744 INFO L574 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-07-25 09:01:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2018-07-25 09:01:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2018-07-25 09:01:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-07-25 09:01:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2573 transitions. [2018-07-25 09:01:09,905 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2573 transitions. Word has length 2 [2018-07-25 09:01:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 09:01:09,906 INFO L472 AbstractCegarLoop]: Abstraction has 1560 states and 2573 transitions. [2018-07-25 09:01:09,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 09:01:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2573 transitions. [2018-07-25 09:01:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 09:01:09,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 09:01:09,917 INFO L354 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-07-25 09:01:09,921 INFO L415 AbstractCegarLoop]: === Iteration 3 === [int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-07-25 09:01:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -127431756, now seen corresponding path program 1 times [2018-07-25 09:01:09,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 09:01:10,037 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 09:01:10,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 09:01:10,038 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 09:01:10,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 09:01:10,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 09:01:10,040 INFO L87 Difference]: Start difference. First operand 1560 states and 2573 transitions. Second operand 3 states. [2018-07-25 09:01:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 09:01:10,209 INFO L93 Difference]: Finished difference Result 1560 states and 2573 transitions. [2018-07-25 09:01:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 09:01:10,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-07-25 09:01:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 09:01:10,220 INFO L225 Difference]: With dead ends: 1560 [2018-07-25 09:01:10,220 INFO L226 Difference]: Without dead ends: 1559 [2018-07-25 09:01:10,221 INFO L574 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-07-25 09:01:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2018-07-25 09:01:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2018-07-25 09:01:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2018-07-25 09:01:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2572 transitions. [2018-07-25 09:01:10,378 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2572 transitions. Word has length 129 [2018-07-25 09:01:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 09:01:10,379 INFO L472 AbstractCegarLoop]: Abstraction has 1559 states and 2572 transitions. [2018-07-25 09:01:10,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 09:01:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2572 transitions. [2018-07-25 09:01:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 09:01:10,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 09:01:10,385 INFO L354 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-07-25 09:01:10,387 INFO L415 AbstractCegarLoop]: === Iteration 4 === [int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-07-25 09:01:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 344588326, now seen corresponding path program 1 times [2018-07-25 09:01:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 09:01:11,556 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-25 09:01:11,872 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-25 09:01:12,152 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-25 09:01:12,815 WARN L169 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-25 09:01:13,957 WARN L169 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-07-25 09:01:14,603 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 09:01:14,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-07-25 09:01:14,603 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 09:01:14,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 09:01:14,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-07-25 09:01:14,605 INFO L87 Difference]: Start difference. First operand 1559 states and 2572 transitions. Second operand 16 states. [2018-07-25 09:01:16,753 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-07-25 09:01:21,137 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-07-25 09:01:30,994 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-07-25 09:01:31,377 WARN L169 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-07-25 09:01:32,008 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-07-25 09:01:32,424 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-07-25 09:01:32,809 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-07-25 09:01:33,301 WARN L169 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-07-25 09:01:35,274 WARN L169 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-07-25 09:01:35,889 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-07-25 09:01:36,192 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-07-25 09:01:38,486 WARN L169 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-07-25 09:01:38,837 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-07-25 09:01:39,332 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-07-25 09:01:40,055 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-07-25 09:01:40,811 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-07-25 09:01:47,319 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-07-25 09:03:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 09:03:01,248 INFO L93 Difference]: Finished difference Result 82488 states and 124041 transitions. [2018-07-25 09:03:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 09:03:01,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2018-07-25 09:03:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 09:03:01,570 INFO L225 Difference]: With dead ends: 82488 [2018-07-25 09:03:01,570 INFO L226 Difference]: Without dead ends: 82484 [2018-07-25 09:03:01,603 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 991 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6593 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2270, Invalid=14242, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 09:03:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82484 states. [2018-07-25 09:03:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82484 to 2446. [2018-07-25 09:03:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2018-07-25 09:03:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4167 transitions. [2018-07-25 09:03:05,463 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4167 transitions. Word has length 130 [2018-07-25 09:03:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 09:03:05,463 INFO L472 AbstractCegarLoop]: Abstraction has 2446 states and 4167 transitions. [2018-07-25 09:03:05,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 09:03:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4167 transitions. [2018-07-25 09:03:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 09:03:05,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 09:03:05,468 INFO L354 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-07-25 09:03:05,470 INFO L415 AbstractCegarLoop]: === Iteration 5 === [int$problem1.Problem1$calculateOutput$1806Err100ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err17ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err120ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err79ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err51ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err83ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err106ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err36ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err110ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err20ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err124ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err11ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err24ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err50ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err94ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err38ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err61ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err76ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err29ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err96ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err46ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err59ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err71ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err86ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err5ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err30ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err15ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err21ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err45ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err103ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err108ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err25ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err64ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err19ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err95ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err74ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err34ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err7ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err78ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err118ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err9ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err111ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err23ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err99ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err12ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err85ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err84ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err27ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err97ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err62ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err41ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err6ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err81ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err113ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err14ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err22ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err105ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err48ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err52ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err66ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err101ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err37ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err55ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err63ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err28ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err32ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err92ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err16ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err13ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err69ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err112ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err0ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err68ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err40ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err42ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err18ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err57ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err91ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err53ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err8ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err109ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err1ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err70ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err54ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err4ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err121ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err58ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err75ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err93ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err122ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err123ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err39ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err82ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err26ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err10ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err72ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err117ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err104ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err31ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err88ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err107ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err43ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err115ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err60ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err3ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err77ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err2ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err102ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err67ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err80ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err89ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err33ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err116ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err47ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err119ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err65ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err44ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err35ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err73ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err114ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err56ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err98ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err90ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err49ASSERT_VIOLATIONASSERT, int$problem1.Problem1$calculateOutput$1806Err87ASSERT_VIOLATIONASSERT, void$problem1.Problem1$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT]=== [2018-07-25 09:03:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 292126886, now seen corresponding path program 1 times [2018-07-25 09:03:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 09:03:06,913 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 09:03:06,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-07-25 09:03:06,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 09:03:06,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 09:03:06,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-07-25 09:03:06,915 INFO L87 Difference]: Start difference. First operand 2446 states and 4167 transitions. Second operand 17 states. [2018-07-25 09:03:07,124 WARN L169 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-07-25 09:03:13,837 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-07-25 09:03:23,263 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-07-25 09:03:23,755 WARN L169 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-07-25 09:03:23,945 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-07-25 09:03:24,858 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-07-25 09:03:25,720 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-07-25 09:03:27,441 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-07-25 09:03:27,889 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-07-25 09:03:28,275 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-07-25 09:03:29,034 WARN L169 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-07-25 09:03:29,354 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-07-25 09:03:31,599 WARN L169 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-07-25 09:03:32,334 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-07-25 09:03:32,983 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-07-25 09:03:34,113 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-07-25 09:03:34,686 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-07-25 09:03:35,575 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-07-25 09:03:36,484 WARN L169 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-07-25 09:03:36,694 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-07-25 09:03:38,045 WARN L169 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-07-25 09:03:41,492 WARN L169 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-07-25 09:03:41,915 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-07-25 09:03:43,509 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-07-25 09:03:44,097 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-07-25 09:03:49,283 WARN L169 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-07-25 09:03:50,702 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-07-25 09:03:50,910 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-07-25 09:03:53,005 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-07-25 09:03:55,114 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-07-25 09:03:56,922 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 60 Received shutdown request... [2018-07-25 09:05:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 09:05:12,194 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 09:05:12,203 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 09:05:12,203 INFO L202 PluginConnector]: Adding new model BigBranchingExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 09:05:12 BoogieIcfgContainer [2018-07-25 09:05:12,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 09:05:12,204 INFO L168 Benchmark]: Toolchain (without parser) took 256863.57 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -653.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-07-25 09:05:12,206 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-07-25 09:05:12,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-25 09:05:12,207 INFO L168 Benchmark]: Boogie Preprocessor took 194.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-07-25 09:05:12,208 INFO L168 Benchmark]: RCFGBuilder took 12982.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Peak memory consumption was 471.6 MB. Max. memory is 7.1 GB. [2018-07-25 09:05:12,209 INFO L168 Benchmark]: TraceAbstraction took 243466.45 ms. Allocated memory was 1.6 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -846.0 MB). Peak memory consumption was 753.6 MB. Max. memory is 7.1 GB. [2018-07-25 09:05:12,213 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 216.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 12982.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Peak memory consumption was 471.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243466.45 ms. Allocated memory was 1.6 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -846.0 MB). Peak memory consumption was 753.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19647]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19647). Cancelled while BasicCegarLoop was constructing difference of abstraction (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13535]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13535). Cancelled while BasicCegarLoop was constructing difference of abstraction (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 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 (2446states) and interpolant automaton (currently 123 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (35987 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 2581 locations, 126 error locations. TIMEOUT Result, 243.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 232.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22417 SDtfs, 291834 SDslu, 192793 SDs, 0 SdLazy, 86978 SolverSat, 3505 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 110.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2179 SyntacticMatches, 5 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14602 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2446occurred in iteration=4, 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: 4.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 80038 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 5.7s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_09-05-12-237.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BigBranchingExample.bpl_AutomizerBpl-pdr.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_09-05-12-237.csv Completed graceful shutdown