java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:04,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:04,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:04,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:04,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:04,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:04,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:04,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:04,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:04,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:04,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:04,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:04,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:04,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:04,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:04,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:04,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:04,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:04,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:04,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:04,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:04,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:04,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:04,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:04,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:04,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:04,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:04,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:04,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:04,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:04,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:04,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:04,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:04,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:04,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:04,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:04,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:04,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:04,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:04,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:04,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:04,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:09:04,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:04,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:04,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:04,970 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:04,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:04,971 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:04,971 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:04,971 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:04,971 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:04,971 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:04,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:04,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:04,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:04,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:04,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:04,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:04,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:04,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:04,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:04,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:04,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:04,974 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:04,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:04,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:04,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:04,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:04,975 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:04,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:04,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:04,976 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:05,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:05,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:05,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:05,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:05,020 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:05,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-03 04:09:05,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d0dd912/97e8470bb5aa4ff69b8696549d8061c2/FLAG7295a4eef [2019-10-03 04:09:05,496 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:05,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-03 04:09:05,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d0dd912/97e8470bb5aa4ff69b8696549d8061c2/FLAG7295a4eef [2019-10-03 04:09:05,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d0dd912/97e8470bb5aa4ff69b8696549d8061c2 [2019-10-03 04:09:05,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:05,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:05,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:05,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:05,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:05,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fe4094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:05, skipping insertion in model container [2019-10-03 04:09:05,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:05" (1/1) ... [2019-10-03 04:09:05,922 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:05,952 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:06,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:06,195 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:06,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:06,325 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:06,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06 WrapperNode [2019-10-03 04:09:06,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:06,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:06,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:06,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:06,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (1/1) ... [2019-10-03 04:09:06,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:06,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:06,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:06,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:06,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:06,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:06,737 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:06,737 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:06,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:06 BoogieIcfgContainer [2019-10-03 04:09:06,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:06,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:06,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:06,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:06,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:05" (1/3) ... [2019-10-03 04:09:06,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a9e828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:06, skipping insertion in model container [2019-10-03 04:09:06,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:06" (2/3) ... [2019-10-03 04:09:06,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a9e828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:06, skipping insertion in model container [2019-10-03 04:09:06,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:06" (3/3) ... [2019-10-03 04:09:06,751 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-10-03 04:09:06,765 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:06,770 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:06,784 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:06,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:06,809 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:06,809 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:06,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:06,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:06,810 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:06,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:06,810 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-03 04:09:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-03 04:09:06,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:06,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:06,839 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:06,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2019-10-03 04:09:06,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:06,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:06,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:06,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:06,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:06,990 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-03 04:09:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,113 INFO L93 Difference]: Finished difference Result 91 states and 139 transitions. [2019-10-03 04:09:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:07,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-03 04:09:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,127 INFO L225 Difference]: With dead ends: 91 [2019-10-03 04:09:07,127 INFO L226 Difference]: Without dead ends: 83 [2019-10-03 04:09:07,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-03 04:09:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-03 04:09:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-03 04:09:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2019-10-03 04:09:07,173 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2019-10-03 04:09:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,174 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2019-10-03 04:09:07,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2019-10-03 04:09:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 04:09:07,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,176 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2019-10-03 04:09:07,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:07,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,212 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2019-10-03 04:09:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,309 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2019-10-03 04:09:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:07,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 04:09:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,312 INFO L225 Difference]: With dead ends: 121 [2019-10-03 04:09:07,312 INFO L226 Difference]: Without dead ends: 121 [2019-10-03 04:09:07,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-03 04:09:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-03 04:09:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-03 04:09:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2019-10-03 04:09:07,328 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2019-10-03 04:09:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,329 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2019-10-03 04:09:07,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2019-10-03 04:09:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 04:09:07,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,331 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,331 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2019-10-03 04:09:07,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 04:09:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:07,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,387 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2019-10-03 04:09:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,461 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2019-10-03 04:09:07,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:07,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 04:09:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,464 INFO L225 Difference]: With dead ends: 159 [2019-10-03 04:09:07,468 INFO L226 Difference]: Without dead ends: 159 [2019-10-03 04:09:07,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-03 04:09:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-10-03 04:09:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-03 04:09:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2019-10-03 04:09:07,490 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2019-10-03 04:09:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,491 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2019-10-03 04:09:07,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2019-10-03 04:09:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 04:09:07,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,493 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,493 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2019-10-03 04:09:07,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 04:09:07,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:07,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,558 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2019-10-03 04:09:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,677 INFO L93 Difference]: Finished difference Result 217 states and 300 transitions. [2019-10-03 04:09:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:07,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 04:09:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,680 INFO L225 Difference]: With dead ends: 217 [2019-10-03 04:09:07,680 INFO L226 Difference]: Without dead ends: 217 [2019-10-03 04:09:07,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-03 04:09:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-10-03 04:09:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-03 04:09:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2019-10-03 04:09:07,697 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2019-10-03 04:09:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,698 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2019-10-03 04:09:07,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2019-10-03 04:09:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 04:09:07,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,703 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,703 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2019-10-03 04:09:07,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 04:09:07,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:07,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,799 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2019-10-03 04:09:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,857 INFO L93 Difference]: Finished difference Result 264 states and 370 transitions. [2019-10-03 04:09:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:07,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-03 04:09:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,862 INFO L225 Difference]: With dead ends: 264 [2019-10-03 04:09:07,863 INFO L226 Difference]: Without dead ends: 264 [2019-10-03 04:09:07,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-03 04:09:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-03 04:09:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-03 04:09:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-10-03 04:09:07,888 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2019-10-03 04:09:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,888 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-10-03 04:09:07,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-10-03 04:09:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 04:09:07,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,893 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 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] [2019-10-03 04:09:07,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2019-10-03 04:09:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 04:09:07,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:07,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:07,959 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2019-10-03 04:09:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,048 INFO L93 Difference]: Finished difference Result 270 states and 345 transitions. [2019-10-03 04:09:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:08,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-03 04:09:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,051 INFO L225 Difference]: With dead ends: 270 [2019-10-03 04:09:08,051 INFO L226 Difference]: Without dead ends: 192 [2019-10-03 04:09:08,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-03 04:09:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-10-03 04:09:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-03 04:09:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2019-10-03 04:09:08,059 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2019-10-03 04:09:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,059 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2019-10-03 04:09:08,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2019-10-03 04:09:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 04:09:08,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,063 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-03 04:09:08,063 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2019-10-03 04:09:08,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 04:09:08,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:08,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:08,138 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2019-10-03 04:09:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,148 INFO L93 Difference]: Finished difference Result 206 states and 260 transitions. [2019-10-03 04:09:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:08,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-03 04:09:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,149 INFO L225 Difference]: With dead ends: 206 [2019-10-03 04:09:08,149 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:09:08,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:09:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:09:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:09:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:09:08,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-10-03 04:09:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:09:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:09:08,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:09:08,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:09:08 BoogieIcfgContainer [2019-10-03 04:09:08,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:09:08,160 INFO L168 Benchmark]: Toolchain (without parser) took 2251.57 ms. Allocated memory was 132.1 MB in the beginning and 221.8 MB in the end (delta: 89.7 MB). Free memory was 87.9 MB in the beginning and 149.5 MB in the end (delta: -61.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,161 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.83 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 176.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,164 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 173.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,165 INFO L168 Benchmark]: RCFGBuilder took 370.79 ms. Allocated memory is still 199.2 MB. Free memory was 173.7 MB in the beginning and 154.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,167 INFO L168 Benchmark]: TraceAbstraction took 1414.84 ms. Allocated memory was 199.2 MB in the beginning and 221.8 MB in the end (delta: 22.5 MB). Free memory was 154.4 MB in the beginning and 149.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:08,174 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 418.83 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 176.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 173.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.79 ms. Allocated memory is still 199.2 MB. Free memory was 173.7 MB in the beginning and 154.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1414.84 ms. Allocated memory was 199.2 MB in the beginning and 221.8 MB in the end (delta: 22.5 MB). Free memory was 154.4 MB in the beginning and 149.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 1.3s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 250 SDslu, 321 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 25301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...