java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/apply.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:39:35,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:39:35,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:39:35,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:39:35,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:39:35,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:39:35,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:39:35,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:39:35,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:39:35,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:39:35,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:39:35,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:39:35,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:39:35,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:39:35,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:39:35,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:39:35,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:39:35,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:39:35,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:39:35,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:39:35,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:39:35,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:39:35,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:39:35,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:39:35,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:39:35,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:39:35,998 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:39:35,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:39:35,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:39:36,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:39:36,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:39:36,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:39:36,001 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:39:36,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:39:36,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:39:36,003 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:39:36,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:39:36,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:39:36,017 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:39:36,018 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:39:36,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:39:36,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:39:36,019 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:39:36,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:39:36,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:36,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:39:36,020 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:39:36,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:39:36,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:39:36,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:39:36,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:39:36,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:39:36,022 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:39:36,023 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:39:36,023 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:39:36,068 INFO ]: Repository-Root is: /tmp [2018-06-22 01:39:36,087 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:39:36,094 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:39:36,095 INFO ]: Initializing SmtParser... [2018-06-22 01:39:36,096 INFO ]: SmtParser initialized [2018-06-22 01:39:36,096 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/apply.smt2 [2018-06-22 01:39:36,098 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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-06-22 01:39:36,197 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/apply.smt2 unknown [2018-06-22 01:39:36,398 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/apply.smt2 [2018-06-22 01:39:36,404 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:39:36,411 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:39:36,411 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:39:36,411 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:39:36,412 INFO ]: ChcToBoogie initialized [2018-06-22 01:39:36,415 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,476 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36 Unit [2018-06-22 01:39:36,477 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:39:36,477 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:39:36,477 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:39:36,477 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:39:36,500 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,500 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,505 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,506 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,509 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,512 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,513 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... [2018-06-22 01:39:36,514 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:39:36,516 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:39:36,516 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:39:36,516 INFO ]: RCFGBuilder initialized [2018-06-22 01:39:36,521 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:36,535 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:39:36,535 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:39:36,535 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:39:36,535 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:39:36,535 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:39:36,535 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:39:36,910 INFO ]: Using library mode [2018-06-22 01:39:36,910 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:36 BoogieIcfgContainer [2018-06-22 01:39:36,910 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:39:36,912 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:39:36,912 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:39:36,915 INFO ]: TraceAbstraction initialized [2018-06-22 01:39:36,916 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:39:36" (1/3) ... [2018-06-22 01:39:36,917 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f70d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:39:36, skipping insertion in model container [2018-06-22 01:39:36,917 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:39:36" (2/3) ... [2018-06-22 01:39:36,917 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f70d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:39:36, skipping insertion in model container [2018-06-22 01:39:36,917 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:39:36" (3/3) ... [2018-06-22 01:39:36,919 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:39:36,929 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:39:36,939 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:39:36,990 INFO ]: Using default assertion order modulation [2018-06-22 01:39:36,991 INFO ]: Interprodecural is true [2018-06-22 01:39:36,991 INFO ]: Hoare is false [2018-06-22 01:39:36,991 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:39:36,991 INFO ]: Backedges is TWOTRACK [2018-06-22 01:39:36,991 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:39:36,991 INFO ]: Difference is false [2018-06-22 01:39:36,991 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:39:36,991 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:39:37,015 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 01:39:37,028 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:39:37,028 INFO ]: Found error trace [2018-06-22 01:39:37,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:37,029 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:37,033 INFO ]: Analyzing trace with hash 1324672966, now seen corresponding path program 1 times [2018-06-22 01:39:37,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:37,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:37,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:37,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:37,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:37,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:37,192 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:37,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:37,195 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:37,197 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:37,209 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:37,210 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:37,212 INFO ]: Start difference. First operand 29 states. Second operand 4 states. [2018-06-22 01:39:37,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:37,731 INFO ]: Finished difference Result 50 states and 68 transitions. [2018-06-22 01:39:37,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:37,734 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:39:37,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:37,749 INFO ]: With dead ends: 50 [2018-06-22 01:39:37,749 INFO ]: Without dead ends: 50 [2018-06-22 01:39:37,753 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:37,772 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:39:37,806 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 01:39:37,807 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:39:37,811 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2018-06-22 01:39:37,812 INFO ]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 9 [2018-06-22 01:39:37,813 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:37,813 INFO ]: Abstraction has 50 states and 68 transitions. [2018-06-22 01:39:37,813 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:37,813 INFO ]: Start isEmpty. Operand 50 states and 68 transitions. [2018-06-22 01:39:37,815 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:39:37,815 INFO ]: Found error trace [2018-06-22 01:39:37,815 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:37,815 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:37,815 INFO ]: Analyzing trace with hash 1868626835, now seen corresponding path program 1 times [2018-06-22 01:39:37,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:37,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:37,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:37,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:37,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:37,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:37,859 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:39:37,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:37,859 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:37,860 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:37,861 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:37,861 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:37,863 INFO ]: Start difference. First operand 50 states and 68 transitions. Second operand 4 states. [2018-06-22 01:39:38,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:38,164 INFO ]: Finished difference Result 72 states and 99 transitions. [2018-06-22 01:39:38,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:38,164 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:39:38,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:38,169 INFO ]: With dead ends: 72 [2018-06-22 01:39:38,169 INFO ]: Without dead ends: 72 [2018-06-22 01:39:38,171 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:38,171 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:39:38,181 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 01:39:38,181 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:39:38,184 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2018-06-22 01:39:38,185 INFO ]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 9 [2018-06-22 01:39:38,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:38,185 INFO ]: Abstraction has 72 states and 99 transitions. [2018-06-22 01:39:38,185 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:38,185 INFO ]: Start isEmpty. Operand 72 states and 99 transitions. [2018-06-22 01:39:38,188 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:39:38,188 INFO ]: Found error trace [2018-06-22 01:39:38,188 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:38,188 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:38,188 INFO ]: Analyzing trace with hash -1999808136, now seen corresponding path program 1 times [2018-06-22 01:39:38,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:38,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:38,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:38,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:38,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:38,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:38,262 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:38,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:38,262 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:38,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:38,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:38,323 INFO ]: Computing forward predicates... [2018-06-22 01:39:38,363 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:39:38,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:38,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:38,403 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:38,403 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:38,403 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:38,403 INFO ]: Start difference. First operand 72 states and 99 transitions. Second operand 4 states. [2018-06-22 01:39:38,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:38,809 INFO ]: Finished difference Result 93 states and 129 transitions. [2018-06-22 01:39:38,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:38,810 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 01:39:38,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:38,812 INFO ]: With dead ends: 93 [2018-06-22 01:39:38,816 INFO ]: Without dead ends: 93 [2018-06-22 01:39:38,817 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:38,817 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:39:38,835 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-06-22 01:39:38,835 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 01:39:38,840 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2018-06-22 01:39:38,840 INFO ]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 20 [2018-06-22 01:39:38,840 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:38,840 INFO ]: Abstraction has 93 states and 129 transitions. [2018-06-22 01:39:38,840 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:38,840 INFO ]: Start isEmpty. Operand 93 states and 129 transitions. [2018-06-22 01:39:38,846 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:39:38,846 INFO ]: Found error trace [2018-06-22 01:39:38,846 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:38,846 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:38,847 INFO ]: Analyzing trace with hash -1258357626, now seen corresponding path program 1 times [2018-06-22 01:39:38,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:38,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:38,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:38,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:38,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:38,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:39,301 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:39:39,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:39,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:39,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:39,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:39,323 INFO ]: Computing forward predicates... [2018-06-22 01:39:39,388 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:39:39,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:39,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:39:39,415 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:39:39,415 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:39:39,415 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:39:39,416 INFO ]: Start difference. First operand 93 states and 129 transitions. Second operand 9 states. [2018-06-22 01:39:40,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:40,876 INFO ]: Finished difference Result 248 states and 505 transitions. [2018-06-22 01:39:40,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:39:40,876 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 01:39:40,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:40,890 INFO ]: With dead ends: 248 [2018-06-22 01:39:40,890 INFO ]: Without dead ends: 224 [2018-06-22 01:39:40,891 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:39:40,891 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 01:39:40,945 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 133. [2018-06-22 01:39:40,945 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 01:39:40,948 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2018-06-22 01:39:40,948 INFO ]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 21 [2018-06-22 01:39:40,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:40,948 INFO ]: Abstraction has 133 states and 191 transitions. [2018-06-22 01:39:40,948 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:39:40,948 INFO ]: Start isEmpty. Operand 133 states and 191 transitions. [2018-06-22 01:39:40,954 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:39:40,954 INFO ]: Found error trace [2018-06-22 01:39:40,954 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:40,954 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:40,954 INFO ]: Analyzing trace with hash -646727460, now seen corresponding path program 1 times [2018-06-22 01:39:40,954 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:40,954 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:40,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:40,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:40,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:40,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:41,011 INFO ]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:39:41,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:41,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:41,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:41,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:41,044 INFO ]: Computing forward predicates... [2018-06-22 01:39:41,050 INFO ]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:39:41,078 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:41,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:41,078 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:41,078 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:41,078 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:41,078 INFO ]: Start difference. First operand 133 states and 191 transitions. Second operand 4 states. [2018-06-22 01:39:41,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:41,261 INFO ]: Finished difference Result 151 states and 211 transitions. [2018-06-22 01:39:41,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:41,262 INFO ]: Start accepts. Automaton has 4 states. Word has length 32 [2018-06-22 01:39:41,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:41,263 INFO ]: With dead ends: 151 [2018-06-22 01:39:41,263 INFO ]: Without dead ends: 113 [2018-06-22 01:39:41,264 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:41,264 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 01:39:41,284 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-06-22 01:39:41,284 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-22 01:39:41,291 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2018-06-22 01:39:41,291 INFO ]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 32 [2018-06-22 01:39:41,291 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:41,291 INFO ]: Abstraction has 113 states and 151 transitions. [2018-06-22 01:39:41,291 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:41,291 INFO ]: Start isEmpty. Operand 113 states and 151 transitions. [2018-06-22 01:39:41,296 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:39:41,296 INFO ]: Found error trace [2018-06-22 01:39:41,296 INFO ]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:41,296 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:41,296 INFO ]: Analyzing trace with hash 1628219085, now seen corresponding path program 1 times [2018-06-22 01:39:41,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:41,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:41,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:41,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:41,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:41,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:41,488 INFO ]: Checked inductivity of 58 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:39:41,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:41,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:39:41,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:41,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:41,555 INFO ]: Computing forward predicates... [2018-06-22 01:39:41,569 INFO ]: Checked inductivity of 58 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:39:41,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:41,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:41,603 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:41,603 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:41,603 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:41,603 INFO ]: Start difference. First operand 113 states and 151 transitions. Second operand 4 states. [2018-06-22 01:39:41,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:41,883 INFO ]: Finished difference Result 118 states and 157 transitions. [2018-06-22 01:39:41,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:41,884 INFO ]: Start accepts. Automaton has 4 states. Word has length 49 [2018-06-22 01:39:41,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:41,885 INFO ]: With dead ends: 118 [2018-06-22 01:39:41,885 INFO ]: Without dead ends: 106 [2018-06-22 01:39:41,886 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:41,886 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:39:41,893 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-22 01:39:41,893 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 01:39:41,895 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2018-06-22 01:39:41,895 INFO ]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 49 [2018-06-22 01:39:41,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:41,895 INFO ]: Abstraction has 106 states and 139 transitions. [2018-06-22 01:39:41,895 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:41,895 INFO ]: Start isEmpty. Operand 106 states and 139 transitions. [2018-06-22 01:39:41,897 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 01:39:41,897 INFO ]: Found error trace [2018-06-22 01:39:41,898 INFO ]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:41,898 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:41,898 INFO ]: Analyzing trace with hash -1733146465, now seen corresponding path program 1 times [2018-06-22 01:39:41,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:41,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:41,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:41,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:41,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:41,918 INFO ]: Conjunction of SSA is sat [2018-06-22 01:39:41,921 INFO ]: Counterexample might be feasible [2018-06-22 01:39:41,939 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:39:41 BoogieIcfgContainer [2018-06-22 01:39:41,939 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:39:41,940 INFO ]: Toolchain (without parser) took 5535.23 ms. Allocated memory was 306.7 MB in the beginning and 338.7 MB in the end (delta: 32.0 MB). Free memory was 263.1 MB in the beginning and 269.1 MB in the end (delta: -6.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:41,942 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:41,942 INFO ]: ChcToBoogie took 65.60 ms. Allocated memory is still 306.7 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:41,943 INFO ]: Boogie Preprocessor took 37.27 ms. Allocated memory is still 306.7 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:41,943 INFO ]: RCFGBuilder took 394.51 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 250.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:41,944 INFO ]: TraceAbstraction took 5027.68 ms. Allocated memory was 306.7 MB in the beginning and 338.7 MB in the end (delta: 32.0 MB). Free memory was 249.0 MB in the beginning and 269.1 MB in the end (delta: -20.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:41,947 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.60 ms. Allocated memory is still 306.7 MB. Free memory was 262.1 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.27 ms. Allocated memory is still 306.7 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 394.51 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 250.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5027.68 ms. Allocated memory was 306.7 MB in the beginning and 338.7 MB in the end (delta: 32.0 MB). Free memory was 249.0 MB in the beginning and 269.1 MB in the end (delta: -20.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 7) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 5) [L0] COND FALSE !(gotoSwitch == 3) [L0] assume !((!(0 == hbv_False_3_Int) || hbv_False_1_Int == hbv_False_2_Int) && (0 == hbv_False_3_Int || !(hbv_False_1_Int == hbv_False_2_Int))) && 0 == hbv_False_3_Int; [L0] hhv_gDLRunknownCLN6_0_Int, hhv_gDLRunknownCLN6_1_Int := hbv_False_2_Int, hbv_False_1_Int; [L0] havoc hbv_False_1_Int, hbv_False_3_Int, hbv_False_2_Int; [L0] assume true; [L0] CALL call gotoProc(7, hhv_gDLRunknownCLN6_0_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND TRUE gotoSwitch == 7 [L0] hhv_applyDLRunknownCLN1_0_Int := gpav_0_Int; [L0] assume true; [L0] hhv_applyDLRunknownCLN3_0_Int := hhv_applyDLRunknownCLN1_0_Int; [L0] assume true; [L0] hhv_kDLRunknownCLN8_0_Int := hhv_applyDLRunknownCLN3_0_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(7, hhv_gDLRunknownCLN6_0_Int, 0, 0); [L0] hhv_kDLRunknownCLN8_0_Int := hhv_gDLRunknownCLN6_1_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == hbv_kDLRunknownCLN8_1_Int + 1; [L0] CALL call gotoProc(3, hbv_kDLRunknownCLN8_2_Int, hbv_kDLRunknownCLN8_1_Int, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 7) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 5) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_applyDLRunknownCLN4_0_Int, hhv_applyDLRunknownCLN4_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume hhv_applyDLRunknownCLN4_0_Int == hbv_applyDLRunknownCLN4_1_Int; [L0] CALL call gotoProc(6, hhv_applyDLRunknownCLN4_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 7) [L0] COND TRUE gotoSwitch == 6 [L0] hhv_applyDLRunknownCLN3_0_Int := gpav_0_Int; [L0] assume true; [L0] hhv_kDLRunknownCLN8_0_Int := hhv_applyDLRunknownCLN3_0_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(6, hhv_applyDLRunknownCLN4_1_Int, 0, 0); [L0] hhv_applyDLRunknownCLN2_0_Int, hhv_applyDLRunknownCLN2_1_Int := hbv_applyDLRunknownCLN4_1_Int, hhv_applyDLRunknownCLN4_1_Int; [L0] havoc hbv_applyDLRunknownCLN4_1_Int; [L0] assume true; [L0] CALL call gotoProc(5, hhv_applyDLRunknownCLN2_0_Int, hhv_applyDLRunknownCLN2_1_Int, hbv_applyDLRunknownCLN2_1_Int); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 7) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 5 [L0] hhv_gDLRunknownCLN7_0_Int, hhv_gDLRunknownCLN7_1_Int, hhv_gDLRunknownCLN7_2_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int; [L0] assume (!((!(0 == hbv_gDLRunknownCLN7_1_Int) || hhv_gDLRunknownCLN7_2_Int == hhv_gDLRunknownCLN7_1_Int) && (0 == hbv_gDLRunknownCLN7_1_Int || !(hhv_gDLRunknownCLN7_2_Int == hhv_gDLRunknownCLN7_1_Int))) && hhv_gDLRunknownCLN7_0_Int == 1) && !(0 == hbv_gDLRunknownCLN7_1_Int); [L0] hhv_gDLRunknownCLN6_0_Int, hhv_gDLRunknownCLN6_1_Int := hhv_gDLRunknownCLN7_1_Int, hhv_gDLRunknownCLN7_2_Int; [L0] havoc hbv_gDLRunknownCLN7_1_Int; [L0] assume true; [L0] CALL call gotoProc(7, hhv_gDLRunknownCLN6_0_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND TRUE gotoSwitch == 7 [L0] hhv_applyDLRunknownCLN1_0_Int := gpav_0_Int; [L0] assume true; [L0] hhv_applyDLRunknownCLN3_0_Int := hhv_applyDLRunknownCLN1_0_Int; [L0] assume true; [L0] hhv_kDLRunknownCLN8_0_Int := hhv_applyDLRunknownCLN3_0_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(7, hhv_gDLRunknownCLN6_0_Int, 0, 0); [L0] hhv_kDLRunknownCLN8_0_Int := hhv_gDLRunknownCLN6_1_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(5, hhv_applyDLRunknownCLN2_0_Int, hhv_applyDLRunknownCLN2_1_Int, hbv_applyDLRunknownCLN2_1_Int); [L0] CALL call gotoProc(7, hhv_applyDLRunknownCLN2_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND TRUE gotoSwitch == 7 [L0] hhv_applyDLRunknownCLN1_0_Int := gpav_0_Int; [L0] assume true; [L0] hhv_applyDLRunknownCLN3_0_Int := hhv_applyDLRunknownCLN1_0_Int; [L0] assume true; [L0] hhv_kDLRunknownCLN8_0_Int := hhv_applyDLRunknownCLN3_0_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(7, hhv_applyDLRunknownCLN2_1_Int, 0, 0); [L0] hhv_kDLRunknownCLN8_0_Int := hbv_applyDLRunknownCLN2_1_Int; [L0] havoc hbv_applyDLRunknownCLN2_1_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(3, hbv_kDLRunknownCLN8_2_Int, hbv_kDLRunknownCLN8_1_Int, 0); [L0] hhv_kDLRunknownCLN8_0_Int := hbv_kDLRunknownCLN8_1_Int; [L0] havoc hbv_kDLRunknownCLN8_1_Int, hbv_kDLRunknownCLN8_2_Int; [L0] assume hhv_kDLRunknownCLN8_0_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. UNSAFE Result, 4.9s OverallTime, 7 OverallIterations, 7 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 322 SDslu, 414 SDs, 0 SdLazy, 588 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred 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: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 91 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 13940 SizeOfPredicates, 9 NumberOfNonLiveVariables, 360 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 156/176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apply.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-39-41-958.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/apply.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-39-41-958.csv Received shutdown request...